./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/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_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/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-aa41828 [2018-11-23 05:20:57,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:20:57,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:20:57,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:20:57,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:20:57,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:20:57,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:20:57,311 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:20:57,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:20:57,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:20:57,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:20:57,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:20:57,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:20:57,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:20:57,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:20:57,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:20:57,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:20:57,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:20:57,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:20:57,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:20:57,321 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:20:57,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:20:57,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:20:57,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:20:57,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:20:57,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:20:57,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:20:57,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:20:57,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:20:57,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:20:57,328 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:20:57,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:20:57,329 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:20:57,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:20:57,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:20:57,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:20:57,331 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:20:57,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:20:57,343 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:20:57,343 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:20:57,344 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:20:57,344 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:20:57,344 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:20:57,344 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:20:57,344 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:20:57,344 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:20:57,345 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:20:57,345 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:20:57,345 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:20:57,345 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:20:57,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:20:57,346 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:20:57,346 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:20:57,346 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:20:57,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:20:57,346 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:20:57,346 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:20:57,347 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:20:57,347 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:20:57,347 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:20:57,347 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:20:57,347 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:20:57,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:20:57,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:20:57,348 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:20:57,348 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:20:57,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:20:57,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:20:57,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:20:57,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:20:57,349 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:20:57,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:20:57,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:20:57,349 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:20:57,349 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_14100a01-f2ef-45e4-8ac3-479681ae3844/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-11-23 05:20:57,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:20:57,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:20:57,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:20:57,390 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:20:57,391 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:20:57,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 05:20:57,437 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/data/e1b5567be/29223c47cccb45b5aeaf6d7a8e8a35ce/FLAG14a4558df [2018-11-23 05:20:57,786 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:20:57,786 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 05:20:57,792 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/data/e1b5567be/29223c47cccb45b5aeaf6d7a8e8a35ce/FLAG14a4558df [2018-11-23 05:20:57,807 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/data/e1b5567be/29223c47cccb45b5aeaf6d7a8e8a35ce [2018-11-23 05:20:57,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:20:57,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:20:57,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:20:57,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:20:57,817 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:20:57,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57, skipping insertion in model container [2018-11-23 05:20:57,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:20:57,853 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:20:58,025 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:20:58,028 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:20:58,049 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:20:58,059 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:20:58,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58 WrapperNode [2018-11-23 05:20:58,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:20:58,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:20:58,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:20:58,060 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:20:58,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:20:58,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:20:58,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:20:58,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:20:58,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:20:58,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:20:58,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:20:58,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:20:58,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:20:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:20:58,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:20:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:20:58,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:20:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:20:58,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:20:58,430 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:20:58,430 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 05:20:58,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:20:58 BoogieIcfgContainer [2018-11-23 05:20:58,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:20:58,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:20:58,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:20:58,434 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:20:58,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:20:57" (1/3) ... [2018-11-23 05:20:58,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213dcd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:20:58, skipping insertion in model container [2018-11-23 05:20:58,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:58" (2/3) ... [2018-11-23 05:20:58,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213dcd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:20:58, skipping insertion in model container [2018-11-23 05:20:58,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:20:58" (3/3) ... [2018-11-23 05:20:58,437 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 05:20:58,448 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:20:58,455 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:20:58,471 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:20:58,503 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:20:58,503 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:20:58,503 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:20:58,503 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:20:58,504 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:20:58,504 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:20:58,504 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:20:58,504 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:20:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 05:20:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 05:20:58,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:58,526 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-11-23 05:20:58,528 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:58,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-11-23 05:20:58,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:58,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:58,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:58,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-11-23 05:20:58,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:58,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:58,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:58,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:58,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:58,701 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-11-23 05:20:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:58,749 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-11-23 05:20:58,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:58,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 05:20:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:58,759 INFO L225 Difference]: With dead ends: 105 [2018-11-23 05:20:58,760 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 05:20:58,762 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-11-23 05:20:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 05:20:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-11-23 05:20:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 05:20:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-11-23 05:20:58,796 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-11-23 05:20:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:58,797 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-11-23 05:20:58,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-11-23 05:20:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 05:20:58,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:58,798 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-11-23 05:20:58,798 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:58,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-11-23 05:20:58,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:58,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:58,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:58,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:58,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:58,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:58,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:58,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:58,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:58,863 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-11-23 05:20:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:58,895 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-11-23 05:20:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:58,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 05:20:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:58,897 INFO L225 Difference]: With dead ends: 147 [2018-11-23 05:20:58,897 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 05:20:58,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 05:20:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 05:20:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 05:20:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-11-23 05:20:58,905 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-11-23 05:20:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:58,905 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-11-23 05:20:58,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-11-23 05:20:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 05:20:58,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:58,906 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-11-23 05:20:58,906 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:58,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-11-23 05:20:58,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:58,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:58,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:58,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:58,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:58,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:58,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:58,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:58,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:58,953 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-11-23 05:20:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:58,974 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-11-23 05:20:58,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:58,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 05:20:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:58,975 INFO L225 Difference]: With dead ends: 135 [2018-11-23 05:20:58,975 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 05:20:58,976 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-11-23 05:20:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 05:20:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-23 05:20:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 05:20:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-11-23 05:20:58,982 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-11-23 05:20:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:58,982 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-11-23 05:20:58,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-11-23 05:20:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 05:20:58,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:58,983 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-11-23 05:20:58,983 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:58,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:58,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-11-23 05:20:58,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:58,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:58,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:58,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:58,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,022 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-11-23 05:20:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,042 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-11-23 05:20:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 05:20:59,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,044 INFO L225 Difference]: With dead ends: 172 [2018-11-23 05:20:59,044 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 05:20:59,044 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-11-23 05:20:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 05:20:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-11-23 05:20:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 05:20:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-11-23 05:20:59,052 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-11-23 05:20:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,052 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-11-23 05:20:59,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-11-23 05:20:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 05:20:59,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,054 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-11-23 05:20:59,054 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-11-23 05:20:59,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,094 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-11-23 05:20:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,117 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-11-23 05:20:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 05:20:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,119 INFO L225 Difference]: With dead ends: 284 [2018-11-23 05:20:59,119 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 05:20:59,120 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-11-23 05:20:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 05:20:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-11-23 05:20:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-23 05:20:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-11-23 05:20:59,131 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-11-23 05:20:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,132 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-11-23 05:20:59,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-11-23 05:20:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:20:59,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,133 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-11-23 05:20:59,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-11-23 05:20:59,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,176 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-11-23 05:20:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,189 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-11-23 05:20:59,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 05:20:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,190 INFO L225 Difference]: With dead ends: 255 [2018-11-23 05:20:59,190 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 05:20:59,191 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-11-23 05:20:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 05:20:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-23 05:20:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 05:20:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-11-23 05:20:59,201 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-11-23 05:20:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,201 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-11-23 05:20:59,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-11-23 05:20:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:20:59,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:20:59,203 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-11-23 05:20:59,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,252 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-11-23 05:20:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,270 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-11-23 05:20:59,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 05:20:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,272 INFO L225 Difference]: With dead ends: 324 [2018-11-23 05:20:59,272 INFO L226 Difference]: Without dead ends: 322 [2018-11-23 05:20:59,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-23 05:20:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-11-23 05:20:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 05:20:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-11-23 05:20:59,283 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-11-23 05:20:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,283 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-11-23 05:20:59,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-11-23 05:20:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:20:59,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,285 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-11-23 05:20:59,285 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-11-23 05:20:59,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,324 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-11-23 05:20:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,352 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-11-23 05:20:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 05:20:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,354 INFO L225 Difference]: With dead ends: 552 [2018-11-23 05:20:59,354 INFO L226 Difference]: Without dead ends: 330 [2018-11-23 05:20:59,355 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-11-23 05:20:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-23 05:20:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-11-23 05:20:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-23 05:20:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-11-23 05:20:59,367 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-11-23 05:20:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,367 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-11-23 05:20:59,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-11-23 05:20:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:20:59,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,368 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-11-23 05:20:59,369 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-11-23 05:20:59,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,405 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-11-23 05:20:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,429 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-11-23 05:20:59,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 05:20:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,431 INFO L225 Difference]: With dead ends: 492 [2018-11-23 05:20:59,432 INFO L226 Difference]: Without dead ends: 334 [2018-11-23 05:20:59,432 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-11-23 05:20:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-23 05:20:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-11-23 05:20:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-23 05:20:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-11-23 05:20:59,444 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-11-23 05:20:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,445 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-11-23 05:20:59,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-11-23 05:20:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:20:59,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,446 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-11-23 05:20:59,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,447 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-11-23 05:20:59,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,482 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-11-23 05:20:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,504 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-11-23 05:20:59,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 05:20:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,507 INFO L225 Difference]: With dead ends: 620 [2018-11-23 05:20:59,507 INFO L226 Difference]: Without dead ends: 618 [2018-11-23 05:20:59,508 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-11-23 05:20:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-23 05:20:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-11-23 05:20:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 05:20:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-11-23 05:20:59,518 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-11-23 05:20:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,518 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-11-23 05:20:59,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-11-23 05:20:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 05:20:59,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,520 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-11-23 05:20:59,520 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-11-23 05:20:59,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,554 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-11-23 05:20:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,587 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-11-23 05:20:59,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 05:20:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,591 INFO L225 Difference]: With dead ends: 1084 [2018-11-23 05:20:59,591 INFO L226 Difference]: Without dead ends: 642 [2018-11-23 05:20:59,592 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-11-23 05:20:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-23 05:20:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-11-23 05:20:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-23 05:20:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-11-23 05:20:59,615 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-11-23 05:20:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,615 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-11-23 05:20:59,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-11-23 05:20:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 05:20:59,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,617 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-11-23 05:20:59,617 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-11-23 05:20:59,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,642 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-11-23 05:20:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,679 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-11-23 05:20:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 05:20:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,682 INFO L225 Difference]: With dead ends: 960 [2018-11-23 05:20:59,682 INFO L226 Difference]: Without dead ends: 650 [2018-11-23 05:20:59,683 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-11-23 05:20:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-23 05:20:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-11-23 05:20:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-23 05:20:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-11-23 05:20:59,706 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-11-23 05:20:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,707 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-11-23 05:20:59,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-11-23 05:20:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 05:20:59,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,708 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-11-23 05:20:59,708 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-11-23 05:20:59,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,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-11-23 05:20:59,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,733 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-11-23 05:20:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,770 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-11-23 05:20:59,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 05:20:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,776 INFO L225 Difference]: With dead ends: 1196 [2018-11-23 05:20:59,776 INFO L226 Difference]: Without dead ends: 1194 [2018-11-23 05:20:59,777 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-11-23 05:20:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-11-23 05:20:59,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-11-23 05:20:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 05:20:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-11-23 05:20:59,809 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-11-23 05:20:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,810 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-11-23 05:20:59,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-11-23 05:20:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 05:20:59,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,812 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-11-23 05:20:59,812 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-11-23 05:20:59,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,845 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-11-23 05:20:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:20:59,893 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-11-23 05:20:59,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:20:59,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 05:20:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:20:59,898 INFO L225 Difference]: With dead ends: 2140 [2018-11-23 05:20:59,898 INFO L226 Difference]: Without dead ends: 1258 [2018-11-23 05:20:59,901 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-11-23 05:20:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-11-23 05:20:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-11-23 05:20:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-11-23 05:20:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-11-23 05:20:59,945 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-11-23 05:20:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:20:59,946 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-11-23 05:20:59,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:20:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-11-23 05:20:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 05:20:59,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:20:59,948 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-11-23 05:20:59,948 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:20:59,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-11-23 05:20:59,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:20:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:20:59,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:20:59,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:20:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:20:59,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:20:59,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:20:59,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:20:59,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:20:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:20:59,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:20:59,973 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-11-23 05:21:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:00,011 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-11-23 05:21:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:00,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 05:21:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:00,016 INFO L225 Difference]: With dead ends: 1884 [2018-11-23 05:21:00,016 INFO L226 Difference]: Without dead ends: 1274 [2018-11-23 05:21:00,018 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-11-23 05:21:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-11-23 05:21:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-11-23 05:21:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-23 05:21:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-11-23 05:21:00,064 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-11-23 05:21:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:00,064 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-11-23 05:21:00,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-11-23 05:21:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 05:21:00,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:00,067 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-11-23 05:21:00,067 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:00,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-11-23 05:21:00,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:00,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:00,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:00,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:00,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:00,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:00,097 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-11-23 05:21:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:00,156 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-11-23 05:21:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:00,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 05:21:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:00,164 INFO L225 Difference]: With dead ends: 2316 [2018-11-23 05:21:00,165 INFO L226 Difference]: Without dead ends: 2314 [2018-11-23 05:21:00,165 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-11-23 05:21:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-23 05:21:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-11-23 05:21:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-11-23 05:21:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-11-23 05:21:00,220 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-11-23 05:21:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:00,220 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-11-23 05:21:00,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-11-23 05:21:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 05:21:00,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:00,223 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-11-23 05:21:00,223 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:00,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-11-23 05:21:00,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:00,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:00,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:00,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:00,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:00,260 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-11-23 05:21:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:00,314 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-11-23 05:21:00,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:00,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 05:21:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:00,323 INFO L225 Difference]: With dead ends: 4236 [2018-11-23 05:21:00,323 INFO L226 Difference]: Without dead ends: 2474 [2018-11-23 05:21:00,326 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-11-23 05:21:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-11-23 05:21:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-11-23 05:21:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-11-23 05:21:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-11-23 05:21:00,401 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-11-23 05:21:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:00,401 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-11-23 05:21:00,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-11-23 05:21:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 05:21:00,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:00,404 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-11-23 05:21:00,404 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:00,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:00,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-11-23 05:21:00,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:00,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:00,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:00,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:00,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:00,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:00,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:00,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:00,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:00,420 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-11-23 05:21:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:00,473 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-11-23 05:21:00,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:00,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 05:21:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:00,482 INFO L225 Difference]: With dead ends: 3708 [2018-11-23 05:21:00,482 INFO L226 Difference]: Without dead ends: 2506 [2018-11-23 05:21:00,484 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-11-23 05:21:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-23 05:21:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-11-23 05:21:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-11-23 05:21:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-11-23 05:21:00,555 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-11-23 05:21:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:00,555 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-11-23 05:21:00,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-11-23 05:21:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 05:21:00,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:00,558 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-11-23 05:21:00,558 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:00,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:00,558 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-11-23 05:21:00,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:00,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:00,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:00,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:00,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:00,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:00,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:00,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:00,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:00,577 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-11-23 05:21:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:00,658 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-11-23 05:21:00,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:00,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 05:21:00,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:00,672 INFO L225 Difference]: With dead ends: 4492 [2018-11-23 05:21:00,672 INFO L226 Difference]: Without dead ends: 4490 [2018-11-23 05:21:00,674 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-11-23 05:21:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-23 05:21:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-11-23 05:21:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-11-23 05:21:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-11-23 05:21:00,783 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-11-23 05:21:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:00,783 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-11-23 05:21:00,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-11-23 05:21:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 05:21:00,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:00,788 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-11-23 05:21:00,788 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:00,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-11-23 05:21:00,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:00,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:00,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:00,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:00,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:00,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:00,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:00,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:00,810 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-11-23 05:21:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:00,911 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-11-23 05:21:00,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:00,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 05:21:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:00,927 INFO L225 Difference]: With dead ends: 8396 [2018-11-23 05:21:00,927 INFO L226 Difference]: Without dead ends: 4874 [2018-11-23 05:21:00,933 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-11-23 05:21:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-23 05:21:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-11-23 05:21:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-11-23 05:21:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-11-23 05:21:01,110 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-11-23 05:21:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:01,111 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-11-23 05:21:01,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-11-23 05:21:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 05:21:01,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:01,114 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-11-23 05:21:01,115 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:01,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-11-23 05:21:01,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:01,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:01,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:01,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:01,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:01,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:01,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:01,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:01,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:01,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:01,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:01,132 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-11-23 05:21:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:01,201 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-11-23 05:21:01,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:01,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 05:21:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:01,212 INFO L225 Difference]: With dead ends: 7308 [2018-11-23 05:21:01,212 INFO L226 Difference]: Without dead ends: 4938 [2018-11-23 05:21:01,216 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-11-23 05:21:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-11-23 05:21:01,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-11-23 05:21:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-11-23 05:21:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-11-23 05:21:01,311 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-11-23 05:21:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:01,311 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-11-23 05:21:01,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-11-23 05:21:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 05:21:01,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:01,315 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-11-23 05:21:01,315 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:01,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-11-23 05:21:01,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:01,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:01,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:01,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:01,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:01,336 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-11-23 05:21:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:01,445 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-11-23 05:21:01,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:01,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 05:21:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:01,461 INFO L225 Difference]: With dead ends: 14412 [2018-11-23 05:21:01,461 INFO L226 Difference]: Without dead ends: 9610 [2018-11-23 05:21:01,467 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-11-23 05:21:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-11-23 05:21:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-11-23 05:21:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-23 05:21:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-11-23 05:21:01,632 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-11-23 05:21:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:01,632 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-11-23 05:21:01,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-11-23 05:21:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 05:21:01,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:01,638 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-11-23 05:21:01,638 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:01,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-11-23 05:21:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:01,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:01,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:01,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:01,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:01,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:01,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:01,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:01,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:01,664 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-11-23 05:21:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:01,792 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-11-23 05:21:01,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:01,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 05:21:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:01,808 INFO L225 Difference]: With dead ends: 11148 [2018-11-23 05:21:01,808 INFO L226 Difference]: Without dead ends: 11146 [2018-11-23 05:21:01,811 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-11-23 05:21:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-23 05:21:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-11-23 05:21:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-23 05:21:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-11-23 05:21:02,005 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-11-23 05:21:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:02,005 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-11-23 05:21:02,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-11-23 05:21:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:21:02,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:02,012 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-11-23 05:21:02,012 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:02,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:02,012 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-11-23 05:21:02,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:02,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:02,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:02,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:02,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:02,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:02,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:02,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:02,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:02,036 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-11-23 05:21:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:02,193 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-11-23 05:21:02,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:02,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 05:21:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:02,213 INFO L225 Difference]: With dead ends: 16780 [2018-11-23 05:21:02,214 INFO L226 Difference]: Without dead ends: 16778 [2018-11-23 05:21:02,218 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-11-23 05:21:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-11-23 05:21:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-11-23 05:21:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-23 05:21:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-11-23 05:21:02,485 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-11-23 05:21:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:02,486 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-11-23 05:21:02,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-11-23 05:21:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:21:02,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:02,497 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-11-23 05:21:02,497 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:02,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-11-23 05:21:02,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:02,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:02,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:02,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:02,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-11-23 05:21:02,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:02,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:02,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:02,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:02,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:02,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:02,517 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2018-11-23 05:21:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:02,716 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2018-11-23 05:21:02,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:02,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 05:21:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:02,739 INFO L225 Difference]: With dead ends: 32908 [2018-11-23 05:21:02,739 INFO L226 Difference]: Without dead ends: 18826 [2018-11-23 05:21:02,755 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-11-23 05:21:02,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2018-11-23 05:21:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2018-11-23 05:21:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2018-11-23 05:21:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2018-11-23 05:21:03,030 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2018-11-23 05:21:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:03,030 INFO L480 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2018-11-23 05:21:03,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2018-11-23 05:21:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:21:03,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:03,043 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-11-23 05:21:03,044 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:03,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2018-11-23 05:21:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:03,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:03,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:03,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:03,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:03,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:03,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:03,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:03,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:03,069 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2018-11-23 05:21:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:03,357 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2018-11-23 05:21:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:03,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 05:21:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:03,388 INFO L225 Difference]: With dead ends: 28428 [2018-11-23 05:21:03,388 INFO L226 Difference]: Without dead ends: 19210 [2018-11-23 05:21:03,402 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-11-23 05:21:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2018-11-23 05:21:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2018-11-23 05:21:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-11-23 05:21:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2018-11-23 05:21:03,829 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2018-11-23 05:21:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:03,829 INFO L480 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2018-11-23 05:21:03,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2018-11-23 05:21:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:21:03,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:03,848 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-11-23 05:21:03,848 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:03,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:03,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2018-11-23 05:21:03,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:03,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:03,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:03,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:03,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:03,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:03,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:03,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:03,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:03,865 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2018-11-23 05:21:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:04,284 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2018-11-23 05:21:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:04,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 05:21:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:04,340 INFO L225 Difference]: With dead ends: 32780 [2018-11-23 05:21:04,340 INFO L226 Difference]: Without dead ends: 32778 [2018-11-23 05:21:04,350 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-11-23 05:21:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2018-11-23 05:21:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2018-11-23 05:21:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2018-11-23 05:21:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2018-11-23 05:21:04,945 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2018-11-23 05:21:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:04,945 INFO L480 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2018-11-23 05:21:04,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2018-11-23 05:21:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:21:04,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:04,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, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:04,960 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:04,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2018-11-23 05:21:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:04,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:04,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:04,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:04,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:04,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:04,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:04,994 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2018-11-23 05:21:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:05,378 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2018-11-23 05:21:05,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:05,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 05:21:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:05,413 INFO L225 Difference]: With dead ends: 65548 [2018-11-23 05:21:05,413 INFO L226 Difference]: Without dead ends: 37386 [2018-11-23 05:21:05,444 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-11-23 05:21:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2018-11-23 05:21:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2018-11-23 05:21:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2018-11-23 05:21:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2018-11-23 05:21:06,149 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2018-11-23 05:21:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:06,150 INFO L480 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2018-11-23 05:21:06,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2018-11-23 05:21:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:21:06,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:06,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:06,166 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:06,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2018-11-23 05:21:06,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:06,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:06,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:06,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:06,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:06,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:06,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:06,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:06,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:06,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:06,200 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2018-11-23 05:21:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:06,545 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2018-11-23 05:21:06,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:06,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 05:21:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:06,575 INFO L225 Difference]: With dead ends: 56076 [2018-11-23 05:21:06,575 INFO L226 Difference]: Without dead ends: 37898 [2018-11-23 05:21:06,589 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-11-23 05:21:06,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2018-11-23 05:21:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2018-11-23 05:21:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2018-11-23 05:21:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2018-11-23 05:21:07,341 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2018-11-23 05:21:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:07,341 INFO L480 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2018-11-23 05:21:07,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2018-11-23 05:21:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:21:07,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:07,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:07,356 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:07,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2018-11-23 05:21:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:07,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:07,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:07,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:07,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:07,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:07,390 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2018-11-23 05:21:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:07,958 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2018-11-23 05:21:07,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:07,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 05:21:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:08,007 INFO L225 Difference]: With dead ends: 63500 [2018-11-23 05:21:08,007 INFO L226 Difference]: Without dead ends: 63498 [2018-11-23 05:21:08,017 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-11-23 05:21:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2018-11-23 05:21:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2018-11-23 05:21:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2018-11-23 05:21:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2018-11-23 05:21:08,932 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2018-11-23 05:21:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:08,932 INFO L480 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2018-11-23 05:21:08,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2018-11-23 05:21:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:21:08,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:08,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:08,959 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:08,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2018-11-23 05:21:08,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:08,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:08,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:08,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:08,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:08,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:08,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:08,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:08,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:08,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:08,993 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2018-11-23 05:21:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:09,752 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2018-11-23 05:21:09,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:09,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 05:21:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:09,808 INFO L225 Difference]: With dead ends: 130060 [2018-11-23 05:21:09,808 INFO L226 Difference]: Without dead ends: 73738 [2018-11-23 05:21:09,847 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-11-23 05:21:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2018-11-23 05:21:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2018-11-23 05:21:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2018-11-23 05:21:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2018-11-23 05:21:11,163 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2018-11-23 05:21:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:11,164 INFO L480 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2018-11-23 05:21:11,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2018-11-23 05:21:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:21:11,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:11,191 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-11-23 05:21:11,191 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:11,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2018-11-23 05:21:11,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:11,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:11,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:11,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:11,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:11,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:11,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:11,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:11,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:11,224 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2018-11-23 05:21:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:11,966 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2018-11-23 05:21:11,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:11,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 05:21:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:12,223 INFO L225 Difference]: With dead ends: 110604 [2018-11-23 05:21:12,224 INFO L226 Difference]: Without dead ends: 74762 [2018-11-23 05:21:12,242 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-11-23 05:21:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2018-11-23 05:21:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2018-11-23 05:21:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2018-11-23 05:21:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2018-11-23 05:21:13,408 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2018-11-23 05:21:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:13,408 INFO L480 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2018-11-23 05:21:13,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2018-11-23 05:21:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:21:13,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:13,436 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-11-23 05:21:13,437 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:13,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2018-11-23 05:21:13,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:13,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:13,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:13,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:13,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:13,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:13,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:13,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:13,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:13,468 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2018-11-23 05:21:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:14,832 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2018-11-23 05:21:14,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:14,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 05:21:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:14,927 INFO L225 Difference]: With dead ends: 122892 [2018-11-23 05:21:14,927 INFO L226 Difference]: Without dead ends: 122890 [2018-11-23 05:21:14,942 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-11-23 05:21:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2018-11-23 05:21:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2018-11-23 05:21:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2018-11-23 05:21:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2018-11-23 05:21:16,467 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2018-11-23 05:21:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:16,467 INFO L480 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2018-11-23 05:21:16,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2018-11-23 05:21:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:21:16,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:16,523 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-11-23 05:21:16,523 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:16,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2018-11-23 05:21:16,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:16,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:16,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:16,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:16,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:16,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:16,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:16,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:16,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:16,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:16,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:16,560 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2018-11-23 05:21:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:18,369 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2018-11-23 05:21:18,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:18,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 05:21:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:18,485 INFO L225 Difference]: With dead ends: 258060 [2018-11-23 05:21:18,485 INFO L226 Difference]: Without dead ends: 145418 [2018-11-23 05:21:18,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2018-11-23 05:21:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2018-11-23 05:21:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2018-11-23 05:21:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2018-11-23 05:21:21,082 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2018-11-23 05:21:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:21,082 INFO L480 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2018-11-23 05:21:21,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2018-11-23 05:21:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 05:21:21,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:21,141 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-11-23 05:21:21,142 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:21,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2018-11-23 05:21:21,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:21,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:21,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:21,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-11-23 05:21:21,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:21,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:21,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:21,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:21,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:21,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:21,164 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2018-11-23 05:21:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:22,682 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2018-11-23 05:21:22,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:22,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 05:21:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:22,821 INFO L225 Difference]: With dead ends: 218124 [2018-11-23 05:21:22,822 INFO L226 Difference]: Without dead ends: 147466 [2018-11-23 05:21:22,884 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-11-23 05:21:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-11-23 05:21:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2018-11-23 05:21:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2018-11-23 05:21:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2018-11-23 05:21:27,330 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2018-11-23 05:21:27,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:27,330 INFO L480 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2018-11-23 05:21:27,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2018-11-23 05:21:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 05:21:27,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:27,388 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-11-23 05:21:27,389 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:27,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2018-11-23 05:21:27,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:27,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:27,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:27,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:27,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:27,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:27,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:27,416 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2018-11-23 05:21:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:29,951 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2018-11-23 05:21:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:29,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 05:21:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:30,438 INFO L225 Difference]: With dead ends: 237578 [2018-11-23 05:21:30,438 INFO L226 Difference]: Without dead ends: 237576 [2018-11-23 05:21:30,457 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-11-23 05:21:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2018-11-23 05:21:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2018-11-23 05:21:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2018-11-23 05:21:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2018-11-23 05:21:33,594 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2018-11-23 05:21:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:33,594 INFO L480 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2018-11-23 05:21:33,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2018-11-23 05:21:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 05:21:33,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:21:33,718 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-11-23 05:21:33,719 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:21:33,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2018-11-23 05:21:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:21:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:33,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:33,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:21:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:33,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:33,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:21:33,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:21:33,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:21:33,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:21:33,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:21:33,740 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2018-11-23 05:21:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:37,495 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2018-11-23 05:21:37,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:21:37,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 05:21:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:21:37,496 INFO L225 Difference]: With dead ends: 512008 [2018-11-23 05:21:37,496 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:21:37,706 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-11-23 05:21:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:21:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:21:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:21:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:21:37,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-11-23 05:21:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:21:37,707 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:21:37,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:21:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:21:37,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:21:37,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:21:37,756 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 05:21:37,756 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:21:37,756 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:21:37,756 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 05:21:37,756 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:21:37,756 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:21:37,756 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-11-23 05:21:37,756 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-23 05:21:37,756 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,757 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-11-23 05:21:37,757 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,757 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,758 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-23 05:21:37,758 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-23 05:21:37,758 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-11-23 05:21:37,758 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-11-23 05:21:37,758 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,758 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,758 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-23 05:21:37,758 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,759 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-11-23 05:21:37,760 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,760 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-11-23 05:21:37,760 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,760 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-11-23 05:21:37,760 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,760 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-11-23 05:21:37,760 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-11-23 05:21:37,760 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,760 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-23 05:21:37,760 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,761 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 05:21:37,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:21:37 BoogieIcfgContainer [2018-11-23 05:21:37,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:21:37,769 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:21:37,769 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:21:37,769 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:21:37,770 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:20:58" (3/4) ... [2018-11-23 05:21:37,774 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:21:37,783 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 05:21:37,784 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 05:21:37,789 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 05:21:37,790 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 05:21:37,790 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 05:21:37,849 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_14100a01-f2ef-45e4-8ac3-479681ae3844/bin-2019/utaipan/witness.graphml [2018-11-23 05:21:37,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:21:37,850 INFO L168 Benchmark]: Toolchain (without parser) took 40039.76 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 959.2 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-11-23 05:21:37,853 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:21:37,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:21:37,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.21 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:21:37,854 INFO L168 Benchmark]: Boogie Preprocessor took 67.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:21:37,854 INFO L168 Benchmark]: RCFGBuilder took 284.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:21:37,854 INFO L168 Benchmark]: TraceAbstraction took 39337.58 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-11-23 05:21:37,854 INFO L168 Benchmark]: Witness Printer took 80.69 ms. Allocated memory is still 5.4 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:21:37,856 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.21 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 284.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39337.58 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 80.69 ms. Allocated memory is still 5.4 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 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, 39.2s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 18.0s 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s 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: 19.2s 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.8s 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...