./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:27:17,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:27:17,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:27:17,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:27:17,054 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:27:17,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:27:17,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:27:17,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:27:17,058 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:27:17,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:27:17,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:27:17,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:27:17,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:27:17,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:27:17,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:27:17,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:27:17,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:27:17,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:27:17,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:27:17,066 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:27:17,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:27:17,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:27:17,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:27:17,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:27:17,069 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:27:17,070 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:27:17,070 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:27:17,071 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:27:17,071 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:27:17,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:27:17,072 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:27:17,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:27:17,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:27:17,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:27:17,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:27:17,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:27:17,074 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:27:17,084 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:27:17,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:27:17,085 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:27:17,085 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:27:17,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:27:17,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:27:17,085 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:27:17,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:27:17,086 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:27:17,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:27:17,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:27:17,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:27:17,086 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:27:17,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:27:17,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:27:17,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:27:17,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:27:17,087 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:27:17,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:27:17,089 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:27:17,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:27:17,089 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:27:17,090 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:27:17,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:27:17,090 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:27:17,090 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:27:17,090 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:27:17,090 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:27:17,090 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:27:17,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:27:17,091 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-11-28 12:27:17,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:27:17,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:27:17,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:27:17,127 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:27:17,127 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:27:17,128 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:27:17,168 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/data/07c9314cc/17cf6602461b446d9d47d1f0a200bc6a/FLAGf9e702dd6 [2018-11-28 12:27:17,513 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:27:17,513 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:27:17,518 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/data/07c9314cc/17cf6602461b446d9d47d1f0a200bc6a/FLAGf9e702dd6 [2018-11-28 12:27:17,942 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/data/07c9314cc/17cf6602461b446d9d47d1f0a200bc6a [2018-11-28 12:27:17,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:27:17,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:27:17,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:27:17,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:27:17,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:27:17,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:17" (1/1) ... [2018-11-28 12:27:17,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3375cb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17, skipping insertion in model container [2018-11-28 12:27:17,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:17" (1/1) ... [2018-11-28 12:27:17,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:27:17,968 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:27:18,077 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:27:18,080 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:27:18,100 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:27:18,109 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:27:18,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18 WrapperNode [2018-11-28 12:27:18,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:27:18,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:27:18,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:27:18,110 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:27:18,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:27:18,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:27:18,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:27:18,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:27:18,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... [2018-11-28 12:27:18,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:27:18,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:27:18,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:27:18,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:27:18,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/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-28 12:27:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:27:18,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:27:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:27:18,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:27:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:27:18,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:27:18,407 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:27:18,408 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:27:18,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:18 BoogieIcfgContainer [2018-11-28 12:27:18,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:27:18,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:27:18,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:27:18,410 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:27:18,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:27:17" (1/3) ... [2018-11-28 12:27:18,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10de56a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:18, skipping insertion in model container [2018-11-28 12:27:18,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:18" (2/3) ... [2018-11-28 12:27:18,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10de56a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:18, skipping insertion in model container [2018-11-28 12:27:18,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:18" (3/3) ... [2018-11-28 12:27:18,413 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:27:18,418 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:27:18,422 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:27:18,431 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:27:18,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:27:18,448 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:27:18,448 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:27:18,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:27:18,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:27:18,449 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:27:18,449 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:27:18,449 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:27:18,449 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:27:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-28 12:27:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:27:18,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:18,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:18,468 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:18,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:18,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-11-28 12:27:18,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:18,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:18,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:18,595 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-28 12:27:18,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:18,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:18,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:18,609 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-28 12:27:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:18,650 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-11-28 12:27:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:18,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 12:27:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:18,659 INFO L225 Difference]: With dead ends: 99 [2018-11-28 12:27:18,659 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 12:27:18,661 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-28 12:27:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 12:27:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-11-28 12:27:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 12:27:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-11-28 12:27:18,690 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-11-28 12:27:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:18,690 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-11-28 12:27:18,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-11-28 12:27:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:27:18,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:18,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:18,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:18,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:18,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-11-28 12:27:18,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:18,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:18,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:18,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:18,735 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-28 12:27:18,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:18,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:18,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:18,738 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-11-28 12:27:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:18,767 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-11-28 12:27:18,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:18,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 12:27:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:18,768 INFO L225 Difference]: With dead ends: 137 [2018-11-28 12:27:18,769 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 12:27:18,770 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-28 12:27:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 12:27:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-28 12:27:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 12:27:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-11-28 12:27:18,777 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-11-28 12:27:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:18,778 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-11-28 12:27:18,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-11-28 12:27:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:27:18,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:18,778 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-28 12:27:18,779 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:18,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:18,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-11-28 12:27:18,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:18,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:18,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:18,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:18,816 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-28 12:27:18,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:18,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:18,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:18,817 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-11-28 12:27:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:18,830 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-11-28 12:27:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:18,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:27:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:18,831 INFO L225 Difference]: With dead ends: 126 [2018-11-28 12:27:18,831 INFO L226 Difference]: Without dead ends: 87 [2018-11-28 12:27:18,832 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-28 12:27:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-28 12:27:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-28 12:27:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 12:27:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-11-28 12:27:18,837 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-11-28 12:27:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:18,837 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-11-28 12:27:18,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-11-28 12:27:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:27:18,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:18,838 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-28 12:27:18,838 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:18,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-11-28 12:27:18,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:18,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:18,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:18,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:18,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:18,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:18,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:18,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:18,872 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-11-28 12:27:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:18,889 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-11-28 12:27:18,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:18,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:27:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:18,891 INFO L225 Difference]: With dead ends: 160 [2018-11-28 12:27:18,891 INFO L226 Difference]: Without dead ends: 158 [2018-11-28 12:27:18,891 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-28 12:27:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-28 12:27:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-11-28 12:27:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 12:27:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-11-28 12:27:18,898 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-11-28 12:27:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:18,898 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-11-28 12:27:18,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-11-28 12:27:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:27:18,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:18,899 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-28 12:27:18,899 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:18,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-11-28 12:27:18,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:18,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:18,926 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-28 12:27:18,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:18,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:18,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:18,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:18,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:18,927 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-11-28 12:27:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:18,939 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-11-28 12:27:18,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:18,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:27:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:18,940 INFO L225 Difference]: With dead ends: 264 [2018-11-28 12:27:18,940 INFO L226 Difference]: Without dead ends: 160 [2018-11-28 12:27:18,941 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-28 12:27:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-28 12:27:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-28 12:27:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-28 12:27:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-11-28 12:27:18,948 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-11-28 12:27:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:18,948 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-11-28 12:27:18,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-11-28 12:27:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:27:18,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:18,949 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-28 12:27:18,949 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:18,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-11-28 12:27:18,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:18,988 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-28 12:27:18,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:18,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:18,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:18,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:18,990 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-11-28 12:27:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,010 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-11-28 12:27:19,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:27:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,012 INFO L225 Difference]: With dead ends: 237 [2018-11-28 12:27:19,012 INFO L226 Difference]: Without dead ends: 162 [2018-11-28 12:27:19,012 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-28 12:27:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-28 12:27:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-28 12:27:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-28 12:27:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-11-28 12:27:19,021 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-11-28 12:27:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,022 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-11-28 12:27:19,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-11-28 12:27:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:27:19,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:19,023 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-11-28 12:27:19,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,054 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-28 12:27:19,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,054 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-11-28 12:27:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,071 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-11-28 12:27:19,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:27:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,075 INFO L225 Difference]: With dead ends: 300 [2018-11-28 12:27:19,075 INFO L226 Difference]: Without dead ends: 298 [2018-11-28 12:27:19,075 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-28 12:27:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-28 12:27:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-11-28 12:27:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-28 12:27:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-11-28 12:27:19,084 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-11-28 12:27:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,084 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-11-28 12:27:19,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-11-28 12:27:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:27:19,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,086 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-28 12:27:19,086 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-11-28 12:27:19,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,106 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-28 12:27:19,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,107 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-11-28 12:27:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,130 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-11-28 12:27:19,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:27:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,132 INFO L225 Difference]: With dead ends: 512 [2018-11-28 12:27:19,132 INFO L226 Difference]: Without dead ends: 306 [2018-11-28 12:27:19,133 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-28 12:27:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-28 12:27:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-28 12:27:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-28 12:27:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-11-28 12:27:19,143 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-11-28 12:27:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,143 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-11-28 12:27:19,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-11-28 12:27:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:27:19,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,144 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-28 12:27:19,144 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-11-28 12:27:19,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,167 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-28 12:27:19,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,169 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-11-28 12:27:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,196 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-11-28 12:27:19,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:27:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,198 INFO L225 Difference]: With dead ends: 456 [2018-11-28 12:27:19,198 INFO L226 Difference]: Without dead ends: 310 [2018-11-28 12:27:19,198 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-28 12:27:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-28 12:27:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-11-28 12:27:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-28 12:27:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-11-28 12:27:19,205 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-11-28 12:27:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,205 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-11-28 12:27:19,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-11-28 12:27:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:27:19,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,206 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-28 12:27:19,207 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-11-28 12:27:19,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,234 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-28 12:27:19,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,235 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-11-28 12:27:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,250 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-11-28 12:27:19,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:27:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,253 INFO L225 Difference]: With dead ends: 572 [2018-11-28 12:27:19,253 INFO L226 Difference]: Without dead ends: 570 [2018-11-28 12:27:19,254 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-28 12:27:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-28 12:27:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-11-28 12:27:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-28 12:27:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-11-28 12:27:19,264 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-11-28 12:27:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,265 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-11-28 12:27:19,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-11-28 12:27:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:27:19,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,266 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-28 12:27:19,266 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-11-28 12:27:19,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,295 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-28 12:27:19,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,296 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-11-28 12:27:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,324 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-11-28 12:27:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:27:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,326 INFO L225 Difference]: With dead ends: 1004 [2018-11-28 12:27:19,326 INFO L226 Difference]: Without dead ends: 594 [2018-11-28 12:27:19,327 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-28 12:27:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-28 12:27:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-11-28 12:27:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-28 12:27:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-11-28 12:27:19,347 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-11-28 12:27:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,347 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-11-28 12:27:19,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-11-28 12:27:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:27:19,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,348 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-28 12:27:19,349 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,349 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-11-28 12:27:19,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:19,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,383 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-11-28 12:27:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,410 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-11-28 12:27:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:27:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,413 INFO L225 Difference]: With dead ends: 888 [2018-11-28 12:27:19,413 INFO L226 Difference]: Without dead ends: 602 [2018-11-28 12:27:19,414 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-28 12:27:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-28 12:27:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-28 12:27:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-28 12:27:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-11-28 12:27:19,431 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-11-28 12:27:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,431 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-11-28 12:27:19,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-11-28 12:27:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:27:19,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,432 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-28 12:27:19,432 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-11-28 12:27:19,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:19,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,451 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-11-28 12:27:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,486 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-11-28 12:27:19,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:27:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,490 INFO L225 Difference]: With dead ends: 1100 [2018-11-28 12:27:19,490 INFO L226 Difference]: Without dead ends: 1098 [2018-11-28 12:27:19,490 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-28 12:27:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-11-28 12:27:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-11-28 12:27:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-28 12:27:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-11-28 12:27:19,516 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-11-28 12:27:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,517 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-11-28 12:27:19,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-11-28 12:27:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:27:19,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,518 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-28 12:27:19,518 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-11-28 12:27:19,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,534 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-28 12:27:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,535 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-11-28 12:27:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,566 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-11-28 12:27:19,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:27:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,570 INFO L225 Difference]: With dead ends: 1980 [2018-11-28 12:27:19,570 INFO L226 Difference]: Without dead ends: 1162 [2018-11-28 12:27:19,572 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-28 12:27:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-28 12:27:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-11-28 12:27:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-28 12:27:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-11-28 12:27:19,607 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-11-28 12:27:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,607 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-11-28 12:27:19,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-11-28 12:27:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:27:19,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,609 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-28 12:27:19,609 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-11-28 12:27:19,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:19,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,624 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-11-28 12:27:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,653 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-11-28 12:27:19,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:27:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,657 INFO L225 Difference]: With dead ends: 1740 [2018-11-28 12:27:19,658 INFO L226 Difference]: Without dead ends: 1178 [2018-11-28 12:27:19,659 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-28 12:27:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-11-28 12:27:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-11-28 12:27:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-28 12:27:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-11-28 12:27:19,695 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-11-28 12:27:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,695 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-11-28 12:27:19,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-11-28 12:27:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:27:19,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,697 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-28 12:27:19,697 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-11-28 12:27:19,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,722 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-28 12:27:19,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,724 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-11-28 12:27:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,774 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-11-28 12:27:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:27:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,781 INFO L225 Difference]: With dead ends: 2124 [2018-11-28 12:27:19,781 INFO L226 Difference]: Without dead ends: 2122 [2018-11-28 12:27:19,782 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-28 12:27:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-28 12:27:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-11-28 12:27:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-11-28 12:27:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-11-28 12:27:19,827 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-11-28 12:27:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,827 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-11-28 12:27:19,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-11-28 12:27:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:27:19,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,830 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-28 12:27:19,830 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-11-28 12:27:19,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:19,850 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-28 12:27:19,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:19,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:19,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:19,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:19,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:19,851 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-11-28 12:27:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:19,905 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-11-28 12:27:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:19,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:27:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:19,912 INFO L225 Difference]: With dead ends: 3916 [2018-11-28 12:27:19,912 INFO L226 Difference]: Without dead ends: 2282 [2018-11-28 12:27:19,915 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-28 12:27:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-11-28 12:27:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-11-28 12:27:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-11-28 12:27:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-11-28 12:27:19,987 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-11-28 12:27:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:19,988 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-11-28 12:27:19,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-11-28 12:27:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:27:19,990 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:19,990 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-28 12:27:19,991 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:19,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-11-28 12:27:19,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:20,038 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-28 12:27:20,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:20,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:20,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:20,039 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-11-28 12:27:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:20,080 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-11-28 12:27:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:20,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:27:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:20,087 INFO L225 Difference]: With dead ends: 3420 [2018-11-28 12:27:20,088 INFO L226 Difference]: Without dead ends: 2314 [2018-11-28 12:27:20,090 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-28 12:27:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-28 12:27:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-11-28 12:27:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-28 12:27:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-11-28 12:27:20,153 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-11-28 12:27:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:20,153 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-11-28 12:27:20,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-11-28 12:27:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:27:20,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:20,155 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-28 12:27:20,156 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:20,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:20,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-11-28 12:27:20,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:20,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:20,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:20,170 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-28 12:27:20,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:20,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:20,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:20,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:20,171 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-11-28 12:27:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:20,238 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-11-28 12:27:20,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:20,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:27:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:20,249 INFO L225 Difference]: With dead ends: 4108 [2018-11-28 12:27:20,249 INFO L226 Difference]: Without dead ends: 4106 [2018-11-28 12:27:20,250 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-28 12:27:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-28 12:27:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-11-28 12:27:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-28 12:27:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-11-28 12:27:20,331 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-11-28 12:27:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:20,331 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-11-28 12:27:20,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-11-28 12:27:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:27:20,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:20,335 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-28 12:27:20,335 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:20,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-11-28 12:27:20,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:20,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:20,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:20,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:20,360 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-28 12:27:20,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:20,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:20,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:20,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:20,361 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-11-28 12:27:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:20,441 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-11-28 12:27:20,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:20,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:27:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:20,453 INFO L225 Difference]: With dead ends: 7756 [2018-11-28 12:27:20,453 INFO L226 Difference]: Without dead ends: 4490 [2018-11-28 12:27:20,458 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-28 12:27:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-28 12:27:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-11-28 12:27:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-11-28 12:27:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-11-28 12:27:20,570 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-11-28 12:27:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:20,571 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-11-28 12:27:20,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-11-28 12:27:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:27:20,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:20,574 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-28 12:27:20,575 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:20,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-11-28 12:27:20,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:20,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:20,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:20,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:20,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:20,592 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-28 12:27:20,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:20,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:20,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:20,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:20,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:20,593 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-11-28 12:27:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:20,666 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-11-28 12:27:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:20,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:27:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:20,678 INFO L225 Difference]: With dead ends: 6732 [2018-11-28 12:27:20,678 INFO L226 Difference]: Without dead ends: 4554 [2018-11-28 12:27:20,682 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-28 12:27:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-11-28 12:27:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-11-28 12:27:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-11-28 12:27:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-11-28 12:27:20,789 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-11-28 12:27:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:20,789 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-11-28 12:27:20,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-11-28 12:27:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:27:20,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:20,793 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-28 12:27:20,793 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:20,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:20,793 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-11-28 12:27:20,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:20,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:20,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:20,806 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-28 12:27:20,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:20,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:20,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:20,807 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-11-28 12:27:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:20,951 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-11-28 12:27:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:20,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:27:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:20,966 INFO L225 Difference]: With dead ends: 13260 [2018-11-28 12:27:20,966 INFO L226 Difference]: Without dead ends: 8842 [2018-11-28 12:27:20,973 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-28 12:27:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-11-28 12:27:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-11-28 12:27:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-28 12:27:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-11-28 12:27:21,248 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-11-28 12:27:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:21,248 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-11-28 12:27:21,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-11-28 12:27:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:27:21,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:21,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:21,255 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:21,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:21,255 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-11-28 12:27:21,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:21,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:21,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:21,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:21,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:21,270 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-28 12:27:21,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:21,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:21,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:21,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:21,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:21,271 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-11-28 12:27:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:21,421 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-11-28 12:27:21,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:21,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:27:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:21,437 INFO L225 Difference]: With dead ends: 10124 [2018-11-28 12:27:21,437 INFO L226 Difference]: Without dead ends: 10122 [2018-11-28 12:27:21,440 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-28 12:27:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-11-28 12:27:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-11-28 12:27:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-28 12:27:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-11-28 12:27:21,645 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-11-28 12:27:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:21,646 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-11-28 12:27:21,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-11-28 12:27:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:27:21,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:21,653 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-28 12:27:21,653 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:21,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-11-28 12:27:21,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:21,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:21,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:21,666 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-28 12:27:21,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:21,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:21,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:21,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:21,667 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-11-28 12:27:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:21,886 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-11-28 12:27:21,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:21,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:27:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:21,908 INFO L225 Difference]: With dead ends: 15244 [2018-11-28 12:27:21,908 INFO L226 Difference]: Without dead ends: 15242 [2018-11-28 12:27:21,913 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-28 12:27:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-11-28 12:27:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-11-28 12:27:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-11-28 12:27:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-11-28 12:27:22,147 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-11-28 12:27:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:22,147 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-11-28 12:27:22,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-11-28 12:27:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:27:22,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:22,161 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-28 12:27:22,161 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:22,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-11-28 12:27:22,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:22,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:22,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:22,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:22,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:22,178 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-28 12:27:22,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:22,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:22,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:22,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:22,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:22,180 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2018-11-28 12:27:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:22,489 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2018-11-28 12:27:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:22,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:27:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:22,512 INFO L225 Difference]: With dead ends: 30348 [2018-11-28 12:27:22,512 INFO L226 Difference]: Without dead ends: 17290 [2018-11-28 12:27:22,527 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-28 12:27:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-11-28 12:27:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2018-11-28 12:27:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2018-11-28 12:27:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2018-11-28 12:27:22,858 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2018-11-28 12:27:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:22,859 INFO L480 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2018-11-28 12:27:22,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2018-11-28 12:27:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:27:22,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:22,872 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-28 12:27:22,873 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:22,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2018-11-28 12:27:22,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:22,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:22,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:22,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:22,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:22,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:22,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:22,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:22,885 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2018-11-28 12:27:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:23,105 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2018-11-28 12:27:23,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:23,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:27:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:23,131 INFO L225 Difference]: With dead ends: 26124 [2018-11-28 12:27:23,131 INFO L226 Difference]: Without dead ends: 17674 [2018-11-28 12:27:23,145 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-28 12:27:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2018-11-28 12:27:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2018-11-28 12:27:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2018-11-28 12:27:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2018-11-28 12:27:23,501 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2018-11-28 12:27:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:23,501 INFO L480 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2018-11-28 12:27:23,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2018-11-28 12:27:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:27:23,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:23,510 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-28 12:27:23,510 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:23,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2018-11-28 12:27:23,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:23,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:23,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:23,522 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-28 12:27:23,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:23,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:23,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:23,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:23,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:23,522 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2018-11-28 12:27:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:23,756 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2018-11-28 12:27:23,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:23,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:27:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:23,780 INFO L225 Difference]: With dead ends: 29708 [2018-11-28 12:27:23,780 INFO L226 Difference]: Without dead ends: 29706 [2018-11-28 12:27:23,785 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-28 12:27:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2018-11-28 12:27:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2018-11-28 12:27:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2018-11-28 12:27:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2018-11-28 12:27:24,079 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2018-11-28 12:27:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:24,080 INFO L480 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2018-11-28 12:27:24,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2018-11-28 12:27:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:27:24,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:24,097 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-28 12:27:24,098 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:24,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2018-11-28 12:27:24,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:24,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:24,122 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-28 12:27:24,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:24,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:24,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:24,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:24,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:24,123 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2018-11-28 12:27:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:24,512 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2018-11-28 12:27:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:24,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:27:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:24,548 INFO L225 Difference]: With dead ends: 60428 [2018-11-28 12:27:24,548 INFO L226 Difference]: Without dead ends: 34314 [2018-11-28 12:27:24,577 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-28 12:27:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2018-11-28 12:27:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2018-11-28 12:27:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2018-11-28 12:27:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2018-11-28 12:27:25,080 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2018-11-28 12:27:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:25,080 INFO L480 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2018-11-28 12:27:25,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2018-11-28 12:27:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:27:25,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:25,090 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-28 12:27:25,090 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:25,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2018-11-28 12:27:25,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:25,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:25,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:25,126 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-28 12:27:25,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:25,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:25,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:25,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:25,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:25,127 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2018-11-28 12:27:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:25,478 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2018-11-28 12:27:25,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:25,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:27:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:25,502 INFO L225 Difference]: With dead ends: 51468 [2018-11-28 12:27:25,502 INFO L226 Difference]: Without dead ends: 34826 [2018-11-28 12:27:25,512 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-28 12:27:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2018-11-28 12:27:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2018-11-28 12:27:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2018-11-28 12:27:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2018-11-28 12:27:25,991 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2018-11-28 12:27:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:25,991 INFO L480 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2018-11-28 12:27:25,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2018-11-28 12:27:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:27:26,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:26,001 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-28 12:27:26,001 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:26,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2018-11-28 12:27:26,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:26,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:26,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:26,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:26,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:26,014 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-28 12:27:26,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:26,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:26,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:26,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:26,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:26,015 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2018-11-28 12:27:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:26,541 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2018-11-28 12:27:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:26,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:27:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:26,585 INFO L225 Difference]: With dead ends: 57356 [2018-11-28 12:27:26,585 INFO L226 Difference]: Without dead ends: 57354 [2018-11-28 12:27:26,595 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-28 12:27:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-11-28 12:27:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2018-11-28 12:27:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2018-11-28 12:27:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2018-11-28 12:27:27,278 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2018-11-28 12:27:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:27,278 INFO L480 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2018-11-28 12:27:27,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2018-11-28 12:27:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:27:27,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:27,305 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-28 12:27:27,305 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:27,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2018-11-28 12:27:27,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:27,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:27,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:27,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:27,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:27,331 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-28 12:27:27,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:27,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:27,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:27,332 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2018-11-28 12:27:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:27,972 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2018-11-28 12:27:27,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:27,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:27:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:28,020 INFO L225 Difference]: With dead ends: 119820 [2018-11-28 12:27:28,020 INFO L226 Difference]: Without dead ends: 67594 [2018-11-28 12:27:28,054 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-28 12:27:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2018-11-28 12:27:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2018-11-28 12:27:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2018-11-28 12:27:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2018-11-28 12:27:29,035 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2018-11-28 12:27:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:29,035 INFO L480 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2018-11-28 12:27:29,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2018-11-28 12:27:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:27:29,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:29,057 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-28 12:27:29,057 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:29,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2018-11-28 12:27:29,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:29,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:29,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:29,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:29,084 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-28 12:27:29,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:29,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:29,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:29,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:29,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:29,085 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2018-11-28 12:27:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:29,681 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2018-11-28 12:27:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:29,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 12:27:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:29,731 INFO L225 Difference]: With dead ends: 101388 [2018-11-28 12:27:29,731 INFO L226 Difference]: Without dead ends: 68618 [2018-11-28 12:27:29,754 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-28 12:27:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2018-11-28 12:27:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2018-11-28 12:27:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2018-11-28 12:27:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2018-11-28 12:27:30,807 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2018-11-28 12:27:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:30,807 INFO L480 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2018-11-28 12:27:30,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2018-11-28 12:27:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:27:30,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:30,828 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-28 12:27:30,828 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:30,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2018-11-28 12:27:30,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:30,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:30,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:30,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:30,861 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-28 12:27:30,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:30,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:30,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:30,862 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2018-11-28 12:27:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:31,981 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2018-11-28 12:27:31,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:31,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 12:27:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:32,047 INFO L225 Difference]: With dead ends: 110602 [2018-11-28 12:27:32,047 INFO L226 Difference]: Without dead ends: 110600 [2018-11-28 12:27:32,055 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-28 12:27:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2018-11-28 12:27:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2018-11-28 12:27:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2018-11-28 12:27:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2018-11-28 12:27:33,181 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2018-11-28 12:27:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:33,181 INFO L480 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2018-11-28 12:27:33,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2018-11-28 12:27:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:27:33,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:33,229 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-28 12:27:33,229 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:33,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2018-11-28 12:27:33,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:33,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:33,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:33,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:33,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:33,262 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-28 12:27:33,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:33,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:33,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:33,263 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2018-11-28 12:27:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:34,784 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2018-11-28 12:27:34,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:34,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 12:27:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:34,785 INFO L225 Difference]: With dead ends: 237576 [2018-11-28 12:27:34,785 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:27:34,858 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-28 12:27:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:27:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:27:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:27:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:27:34,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-28 12:27:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:34,858 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:27:34,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:27:34,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:27:34,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:27:34,888 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:27:34,889 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 12:27:34,889 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,889 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,890 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-11-28 12:27:34,890 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-11-28 12:27:34,890 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-11-28 12:27:34,891 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-11-28 12:27:34,892 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-11-28 12:27:34,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:27:34 BoogieIcfgContainer [2018-11-28 12:27:34,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:27:34,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:27:34,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:27:34,897 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:27:34,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:18" (3/4) ... [2018-11-28 12:27:34,901 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:27:34,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:27:34,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:27:34,911 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:27:34,911 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 12:27:34,911 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:27:34,959 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8f82547c-5c40-40ab-bbb6-b32a20b5ccda/bin-2019/uautomizer/witness.graphml [2018-11-28 12:27:34,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:27:34,960 INFO L168 Benchmark]: Toolchain (without parser) took 17014.68 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 953.3 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 641.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:34,961 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:27:34,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.87 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:34,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.16 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:34,962 INFO L168 Benchmark]: Boogie Preprocessor took 19.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:27:34,962 INFO L168 Benchmark]: RCFGBuilder took 266.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:34,963 INFO L168 Benchmark]: TraceAbstraction took 16488.60 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 655.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:34,963 INFO L168 Benchmark]: Witness Printer took 61.70 ms. Allocated memory is still 3.0 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 633.6 kB). Peak memory consumption was 633.6 kB. Max. memory is 11.5 GB. [2018-11-28 12:27:34,964 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.87 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.16 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 266.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16488.60 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 655.0 MB. Max. memory is 11.5 GB. * Witness Printer took 61.70 ms. Allocated memory is still 3.0 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 633.6 kB). Peak memory consumption was 633.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 16.4s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...