java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:14:01,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:14:01,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:14:01,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:14:01,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:14:01,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:14:01,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:14:01,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:14:01,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:14:01,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:14:01,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:14:01,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:14:01,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:14:01,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:14:01,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:14:01,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:14:01,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:14:01,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:14:01,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:14:01,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:14:01,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:14:01,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:14:01,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:14:01,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:14:01,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:14:01,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:14:01,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:14:01,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:14:01,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:14:01,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:14:01,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:14:01,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:14:01,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:14:01,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:14:01,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:14:01,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:14:01,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:14:01,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:14:01,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:14:01,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:14:01,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:14:01,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:14:01,195 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:14:01,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:14:01,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:14:01,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:14:01,197 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:14:01,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:14:01,198 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:14:01,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:14:01,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:14:01,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:14:01,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:14:01,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:14:01,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:14:01,200 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:14:01,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:14:01,201 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:14:01,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:14:01,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:14:01,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:14:01,201 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:14:01,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:14:01,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:14:01,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:14:01,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:14:01,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:14:01,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:14:01,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:14:01,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:14:01,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:14:01,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:14:01,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:14:01,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:14:01,257 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:14:01,257 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:14:01,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:14:01,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9f85025/14a5ab5ba21f46378ebc830b081f2cf6/FLAG4c48c90b0 [2019-09-08 10:14:02,040 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:14:02,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:14:02,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9f85025/14a5ab5ba21f46378ebc830b081f2cf6/FLAG4c48c90b0 [2019-09-08 10:14:02,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9f85025/14a5ab5ba21f46378ebc830b081f2cf6 [2019-09-08 10:14:02,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:14:02,134 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:14:02,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:14:02,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:14:02,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:14:02,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:14:02" (1/1) ... [2019-09-08 10:14:02,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200f2ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:02, skipping insertion in model container [2019-09-08 10:14:02,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:14:02" (1/1) ... [2019-09-08 10:14:02,149 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:14:02,296 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:14:03,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:14:03,493 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:14:04,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:14:04,772 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:14:04,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04 WrapperNode [2019-09-08 10:14:04,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:14:04,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:14:04,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:14:04,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:14:04,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (1/1) ... [2019-09-08 10:14:04,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (1/1) ... [2019-09-08 10:14:04,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (1/1) ... [2019-09-08 10:14:04,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (1/1) ... [2019-09-08 10:14:04,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (1/1) ... [2019-09-08 10:14:05,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (1/1) ... [2019-09-08 10:14:05,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (1/1) ... [2019-09-08 10:14:05,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:14:05,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:14:05,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:14:05,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:14:05,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-08 10:14:05,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:14:05,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:14:05,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:14:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:14:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:14:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:14:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:14:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:14:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:14:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:14:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:14:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:14:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:14:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:14:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:14:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:14:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:14:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:14:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:14:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:14:08,876 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:14:08,877 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:14:08,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:14:08 BoogieIcfgContainer [2019-09-08 10:14:08,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:14:08,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:14:08,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:14:08,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:14:08,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:14:02" (1/3) ... [2019-09-08 10:14:08,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf0a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:14:08, skipping insertion in model container [2019-09-08 10:14:08,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:14:04" (2/3) ... [2019-09-08 10:14:08,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf0a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:14:08, skipping insertion in model container [2019-09-08 10:14:08,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:14:08" (3/3) ... [2019-09-08 10:14:08,886 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:14:08,896 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:14:08,906 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:14:08,923 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:14:08,961 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:14:08,962 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:14:08,962 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:14:08,962 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:14:08,963 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:14:08,963 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:14:08,963 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:14:08,963 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:14:08,963 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:14:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states. [2019-09-08 10:14:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-08 10:14:09,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:09,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:09,038 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash 98948253, now seen corresponding path program 1 times [2019-09-08 10:14:09,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:09,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:09,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:09,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:09,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:09,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:09,976 INFO L87 Difference]: Start difference. First operand 1439 states. Second operand 3 states. [2019-09-08 10:14:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:10,220 INFO L93 Difference]: Finished difference Result 2885 states and 5050 transitions. [2019-09-08 10:14:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:10,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2019-09-08 10:14:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:10,251 INFO L225 Difference]: With dead ends: 2885 [2019-09-08 10:14:10,252 INFO L226 Difference]: Without dead ends: 2009 [2019-09-08 10:14:10,264 INFO L628 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 [2019-09-08 10:14:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-08 10:14:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2007. [2019-09-08 10:14:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-09-08 10:14:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3354 transitions. [2019-09-08 10:14:10,439 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3354 transitions. Word has length 356 [2019-09-08 10:14:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:10,444 INFO L475 AbstractCegarLoop]: Abstraction has 2007 states and 3354 transitions. [2019-09-08 10:14:10,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3354 transitions. [2019-09-08 10:14:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-08 10:14:10,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:10,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:10,459 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:10,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:10,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1245452013, now seen corresponding path program 1 times [2019-09-08 10:14:10,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:10,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:10,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:10,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:10,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:10,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:10,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:10,937 INFO L87 Difference]: Start difference. First operand 2007 states and 3354 transitions. Second operand 3 states. [2019-09-08 10:14:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:11,107 INFO L93 Difference]: Finished difference Result 4414 states and 7293 transitions. [2019-09-08 10:14:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:11,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-09-08 10:14:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:11,126 INFO L225 Difference]: With dead ends: 4414 [2019-09-08 10:14:11,127 INFO L226 Difference]: Without dead ends: 3001 [2019-09-08 10:14:11,131 INFO L628 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 [2019-09-08 10:14:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2019-09-08 10:14:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2999. [2019-09-08 10:14:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-09-08 10:14:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 4970 transitions. [2019-09-08 10:14:11,245 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 4970 transitions. Word has length 358 [2019-09-08 10:14:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:11,246 INFO L475 AbstractCegarLoop]: Abstraction has 2999 states and 4970 transitions. [2019-09-08 10:14:11,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 4970 transitions. [2019-09-08 10:14:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-08 10:14:11,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:11,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:11,258 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:11,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1357635263, now seen corresponding path program 1 times [2019-09-08 10:14:11,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:11,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:11,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:11,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:11,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:11,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:11,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:11,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:11,532 INFO L87 Difference]: Start difference. First operand 2999 states and 4970 transitions. Second operand 3 states. [2019-09-08 10:14:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:11,806 INFO L93 Difference]: Finished difference Result 7054 states and 11588 transitions. [2019-09-08 10:14:11,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:11,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2019-09-08 10:14:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:11,836 INFO L225 Difference]: With dead ends: 7054 [2019-09-08 10:14:11,838 INFO L226 Difference]: Without dead ends: 4672 [2019-09-08 10:14:11,856 INFO L628 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 [2019-09-08 10:14:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2019-09-08 10:14:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 4670. [2019-09-08 10:14:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2019-09-08 10:14:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 7678 transitions. [2019-09-08 10:14:12,052 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 7678 transitions. Word has length 360 [2019-09-08 10:14:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:12,053 INFO L475 AbstractCegarLoop]: Abstraction has 4670 states and 7678 transitions. [2019-09-08 10:14:12,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 7678 transitions. [2019-09-08 10:14:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-08 10:14:12,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:12,070 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:12,070 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:12,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2072817011, now seen corresponding path program 1 times [2019-09-08 10:14:12,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:12,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:12,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:12,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:12,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:12,337 INFO L87 Difference]: Start difference. First operand 4670 states and 7678 transitions. Second operand 3 states. [2019-09-08 10:14:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:12,827 INFO L93 Difference]: Finished difference Result 11409 states and 18623 transitions. [2019-09-08 10:14:12,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:12,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-09-08 10:14:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:12,879 INFO L225 Difference]: With dead ends: 11409 [2019-09-08 10:14:12,879 INFO L226 Difference]: Without dead ends: 7379 [2019-09-08 10:14:12,891 INFO L628 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 [2019-09-08 10:14:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7379 states. [2019-09-08 10:14:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7379 to 7377. [2019-09-08 10:14:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2019-09-08 10:14:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 12028 transitions. [2019-09-08 10:14:13,308 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 12028 transitions. Word has length 362 [2019-09-08 10:14:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:13,309 INFO L475 AbstractCegarLoop]: Abstraction has 7377 states and 12028 transitions. [2019-09-08 10:14:13,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 12028 transitions. [2019-09-08 10:14:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 10:14:13,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:13,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:13,329 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:13,330 INFO L82 PathProgramCache]: Analyzing trace with hash -396934895, now seen corresponding path program 1 times [2019-09-08 10:14:13,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:13,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:13,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:13,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:13,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:13,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:13,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:13,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:13,633 INFO L87 Difference]: Start difference. First operand 7377 states and 12028 transitions. Second operand 3 states. [2019-09-08 10:14:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:14,156 INFO L93 Difference]: Finished difference Result 18228 states and 29512 transitions. [2019-09-08 10:14:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:14,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-09-08 10:14:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:14,220 INFO L225 Difference]: With dead ends: 18228 [2019-09-08 10:14:14,220 INFO L226 Difference]: Without dead ends: 11514 [2019-09-08 10:14:14,235 INFO L628 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 [2019-09-08 10:14:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2019-09-08 10:14:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 11512. [2019-09-08 10:14:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11512 states. [2019-09-08 10:14:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 18578 transitions. [2019-09-08 10:14:14,730 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 18578 transitions. Word has length 364 [2019-09-08 10:14:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:14,730 INFO L475 AbstractCegarLoop]: Abstraction has 11512 states and 18578 transitions. [2019-09-08 10:14:14,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 18578 transitions. [2019-09-08 10:14:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-08 10:14:14,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:14,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:14,761 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash -621120927, now seen corresponding path program 1 times [2019-09-08 10:14:14,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:14,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:14,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:14,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:14,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:15,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:15,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:15,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:15,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:15,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:15,192 INFO L87 Difference]: Start difference. First operand 11512 states and 18578 transitions. Second operand 3 states. [2019-09-08 10:14:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:15,812 INFO L93 Difference]: Finished difference Result 19693 states and 32268 transitions. [2019-09-08 10:14:15,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:15,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-09-08 10:14:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:15,852 INFO L225 Difference]: With dead ends: 19693 [2019-09-08 10:14:15,852 INFO L226 Difference]: Without dead ends: 16283 [2019-09-08 10:14:15,866 INFO L628 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 [2019-09-08 10:14:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16283 states. [2019-09-08 10:14:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 16281. [2019-09-08 10:14:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16281 states. [2019-09-08 10:14:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16281 states to 16281 states and 26426 transitions. [2019-09-08 10:14:17,431 INFO L78 Accepts]: Start accepts. Automaton has 16281 states and 26426 transitions. Word has length 366 [2019-09-08 10:14:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:17,433 INFO L475 AbstractCegarLoop]: Abstraction has 16281 states and 26426 transitions. [2019-09-08 10:14:17,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 16281 states and 26426 transitions. [2019-09-08 10:14:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 10:14:17,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:17,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:17,465 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1483533551, now seen corresponding path program 1 times [2019-09-08 10:14:17,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:17,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:17,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:17,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:17,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:17,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:17,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:14:17,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:14:17,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:14:17,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:14:17,909 INFO L87 Difference]: Start difference. First operand 16281 states and 26426 transitions. Second operand 5 states. [2019-09-08 10:14:19,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:19,420 INFO L93 Difference]: Finished difference Result 43891 states and 72574 transitions. [2019-09-08 10:14:19,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:14:19,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 367 [2019-09-08 10:14:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:19,520 INFO L225 Difference]: With dead ends: 43891 [2019-09-08 10:14:19,520 INFO L226 Difference]: Without dead ends: 37489 [2019-09-08 10:14:19,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:14:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37489 states. [2019-09-08 10:14:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37489 to 29290. [2019-09-08 10:14:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29290 states. [2019-09-08 10:14:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29290 states to 29290 states and 48050 transitions. [2019-09-08 10:14:21,599 INFO L78 Accepts]: Start accepts. Automaton has 29290 states and 48050 transitions. Word has length 367 [2019-09-08 10:14:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:21,600 INFO L475 AbstractCegarLoop]: Abstraction has 29290 states and 48050 transitions. [2019-09-08 10:14:21,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:14:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 29290 states and 48050 transitions. [2019-09-08 10:14:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 10:14:21,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:21,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:21,630 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash -955060068, now seen corresponding path program 1 times [2019-09-08 10:14:21,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:21,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:21,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:21,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:21,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:22,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:14:22,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:14:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:14:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:14:22,364 INFO L87 Difference]: Start difference. First operand 29290 states and 48050 transitions. Second operand 7 states. [2019-09-08 10:14:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:24,997 INFO L93 Difference]: Finished difference Result 68324 states and 113304 transitions. [2019-09-08 10:14:24,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:14:24,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 367 [2019-09-08 10:14:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:25,159 INFO L225 Difference]: With dead ends: 68324 [2019-09-08 10:14:25,160 INFO L226 Difference]: Without dead ends: 49538 [2019-09-08 10:14:25,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:14:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49538 states. [2019-09-08 10:14:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49538 to 32694. [2019-09-08 10:14:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2019-09-08 10:14:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 53790 transitions. [2019-09-08 10:14:26,630 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 53790 transitions. Word has length 367 [2019-09-08 10:14:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:26,631 INFO L475 AbstractCegarLoop]: Abstraction has 32694 states and 53790 transitions. [2019-09-08 10:14:26,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:14:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 53790 transitions. [2019-09-08 10:14:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-08 10:14:26,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:26,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:26,663 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:26,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1290729985, now seen corresponding path program 1 times [2019-09-08 10:14:26,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:26,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:26,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:27,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:27,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:27,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:27,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:27,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:27,330 INFO L87 Difference]: Start difference. First operand 32694 states and 53790 transitions. Second operand 3 states. [2019-09-08 10:14:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:28,162 INFO L93 Difference]: Finished difference Result 59641 states and 98550 transitions. [2019-09-08 10:14:28,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:28,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2019-09-08 10:14:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:28,209 INFO L225 Difference]: With dead ends: 59641 [2019-09-08 10:14:28,210 INFO L226 Difference]: Without dead ends: 28371 [2019-09-08 10:14:28,267 INFO L628 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 [2019-09-08 10:14:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28371 states. [2019-09-08 10:14:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28371 to 28369. [2019-09-08 10:14:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28369 states. [2019-09-08 10:14:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28369 states to 28369 states and 46858 transitions. [2019-09-08 10:14:30,210 INFO L78 Accepts]: Start accepts. Automaton has 28369 states and 46858 transitions. Word has length 368 [2019-09-08 10:14:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:30,211 INFO L475 AbstractCegarLoop]: Abstraction has 28369 states and 46858 transitions. [2019-09-08 10:14:30,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 28369 states and 46858 transitions. [2019-09-08 10:14:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:14:30,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:30,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:30,224 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:30,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash -940171741, now seen corresponding path program 1 times [2019-09-08 10:14:30,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:30,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:30,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:30,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:30,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:30,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:30,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:14:30,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:14:30,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:14:30,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:14:30,985 INFO L87 Difference]: Start difference. First operand 28369 states and 46858 transitions. Second operand 7 states. [2019-09-08 10:14:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:34,144 INFO L93 Difference]: Finished difference Result 105148 states and 174656 transitions. [2019-09-08 10:14:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:14:34,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-08 10:14:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:34,271 INFO L225 Difference]: With dead ends: 105148 [2019-09-08 10:14:34,271 INFO L226 Difference]: Without dead ends: 86362 [2019-09-08 10:14:34,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:14:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86362 states. [2019-09-08 10:14:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86362 to 35390. [2019-09-08 10:14:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35390 states. [2019-09-08 10:14:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35390 states to 35390 states and 58634 transitions. [2019-09-08 10:14:37,531 INFO L78 Accepts]: Start accepts. Automaton has 35390 states and 58634 transitions. Word has length 372 [2019-09-08 10:14:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:37,532 INFO L475 AbstractCegarLoop]: Abstraction has 35390 states and 58634 transitions. [2019-09-08 10:14:37,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:14:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 35390 states and 58634 transitions. [2019-09-08 10:14:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:14:37,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:37,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:37,546 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1636538100, now seen corresponding path program 1 times [2019-09-08 10:14:37,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:37,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:37,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:37,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:37,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:14:37,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:14:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:14:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:14:37,927 INFO L87 Difference]: Start difference. First operand 35390 states and 58634 transitions. Second operand 5 states. [2019-09-08 10:14:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:42,351 INFO L93 Difference]: Finished difference Result 131600 states and 218682 transitions. [2019-09-08 10:14:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:14:42,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2019-09-08 10:14:42,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:42,550 INFO L225 Difference]: With dead ends: 131600 [2019-09-08 10:14:42,550 INFO L226 Difference]: Without dead ends: 102590 [2019-09-08 10:14:42,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:14:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102590 states. [2019-09-08 10:14:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102590 to 75821. [2019-09-08 10:14:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75821 states. [2019-09-08 10:14:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75821 states to 75821 states and 125344 transitions. [2019-09-08 10:14:48,418 INFO L78 Accepts]: Start accepts. Automaton has 75821 states and 125344 transitions. Word has length 372 [2019-09-08 10:14:48,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:48,419 INFO L475 AbstractCegarLoop]: Abstraction has 75821 states and 125344 transitions. [2019-09-08 10:14:48,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:14:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 75821 states and 125344 transitions. [2019-09-08 10:14:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:14:48,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:48,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:48,428 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash -176117635, now seen corresponding path program 1 times [2019-09-08 10:14:48,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:48,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:48,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:48,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:48,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:49,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:49,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:14:49,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:14:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:14:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:14:49,199 INFO L87 Difference]: Start difference. First operand 75821 states and 125344 transitions. Second operand 7 states. [2019-09-08 10:14:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:59,016 INFO L93 Difference]: Finished difference Result 264313 states and 437588 transitions. [2019-09-08 10:14:59,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:14:59,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-08 10:14:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:59,415 INFO L225 Difference]: With dead ends: 264313 [2019-09-08 10:14:59,415 INFO L226 Difference]: Without dead ends: 208759 [2019-09-08 10:14:59,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:14:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208759 states. [2019-09-08 10:15:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208759 to 79311. [2019-09-08 10:15:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79311 states. [2019-09-08 10:15:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79311 states to 79311 states and 131168 transitions. [2019-09-08 10:15:07,868 INFO L78 Accepts]: Start accepts. Automaton has 79311 states and 131168 transitions. Word has length 372 [2019-09-08 10:15:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:07,869 INFO L475 AbstractCegarLoop]: Abstraction has 79311 states and 131168 transitions. [2019-09-08 10:15:07,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:15:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 79311 states and 131168 transitions. [2019-09-08 10:15:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:15:07,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:07,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:07,877 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash -843485712, now seen corresponding path program 1 times [2019-09-08 10:15:07,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:07,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:07,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:07,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:07,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:08,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:15:08,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:15:08,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:15:08,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:15:08,475 INFO L87 Difference]: Start difference. First operand 79311 states and 131168 transitions. Second operand 7 states. [2019-09-08 10:15:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:20,405 INFO L93 Difference]: Finished difference Result 268079 states and 443880 transitions. [2019-09-08 10:15:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:15:20,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-08 10:15:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:20,707 INFO L225 Difference]: With dead ends: 268079 [2019-09-08 10:15:20,708 INFO L226 Difference]: Without dead ends: 212525 [2019-09-08 10:15:20,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:15:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212525 states. [2019-09-08 10:15:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212525 to 82801. [2019-09-08 10:15:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82801 states. [2019-09-08 10:15:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82801 states to 82801 states and 136992 transitions. [2019-09-08 10:15:26,935 INFO L78 Accepts]: Start accepts. Automaton has 82801 states and 136992 transitions. Word has length 372 [2019-09-08 10:15:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:26,935 INFO L475 AbstractCegarLoop]: Abstraction has 82801 states and 136992 transitions. [2019-09-08 10:15:26,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:15:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 82801 states and 136992 transitions. [2019-09-08 10:15:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:15:26,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:26,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:26,945 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash -359798506, now seen corresponding path program 1 times [2019-09-08 10:15:26,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:26,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:26,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:26,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:26,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:29,335 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 9 [2019-09-08 10:15:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:29,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:29,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:15:29,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:15:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:15:29,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:15:29,639 INFO L87 Difference]: Start difference. First operand 82801 states and 136992 transitions. Second operand 7 states. [2019-09-08 10:15:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:45,489 INFO L93 Difference]: Finished difference Result 275507 states and 456208 transitions. [2019-09-08 10:15:45,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:15:45,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-08 10:15:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:45,844 INFO L225 Difference]: With dead ends: 275507 [2019-09-08 10:15:45,844 INFO L226 Difference]: Without dead ends: 238769 [2019-09-08 10:15:45,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:15:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238769 states. [2019-09-08 10:15:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238769 to 89595. [2019-09-08 10:15:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89595 states. [2019-09-08 10:15:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89595 states to 89595 states and 148256 transitions. [2019-09-08 10:15:53,651 INFO L78 Accepts]: Start accepts. Automaton has 89595 states and 148256 transitions. Word has length 372 [2019-09-08 10:15:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:53,651 INFO L475 AbstractCegarLoop]: Abstraction has 89595 states and 148256 transitions. [2019-09-08 10:15:53,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:15:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 89595 states and 148256 transitions. [2019-09-08 10:15:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 10:15:53,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:53,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:53,660 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash 79488306, now seen corresponding path program 1 times [2019-09-08 10:15:53,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:53,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:53,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:53,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:53,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:54,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:54,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:15:54,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:15:54,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:15:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:15:54,513 INFO L87 Difference]: Start difference. First operand 89595 states and 148256 transitions. Second operand 5 states. [2019-09-08 10:16:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:17,638 INFO L93 Difference]: Finished difference Result 364555 states and 603752 transitions. [2019-09-08 10:16:17,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:16:17,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2019-09-08 10:16:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:18,027 INFO L225 Difference]: With dead ends: 364555 [2019-09-08 10:16:18,027 INFO L226 Difference]: Without dead ends: 282505 [2019-09-08 10:16:18,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282505 states. [2019-09-08 10:16:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282505 to 202478. [2019-09-08 10:16:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202478 states. [2019-09-08 10:16:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202478 states to 202478 states and 334260 transitions. [2019-09-08 10:16:39,369 INFO L78 Accepts]: Start accepts. Automaton has 202478 states and 334260 transitions. Word has length 373 [2019-09-08 10:16:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:39,369 INFO L475 AbstractCegarLoop]: Abstraction has 202478 states and 334260 transitions. [2019-09-08 10:16:39,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:16:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 202478 states and 334260 transitions. [2019-09-08 10:16:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 10:16:39,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:39,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:39,382 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash 994594010, now seen corresponding path program 1 times [2019-09-08 10:16:39,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:39,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:39,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:39,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:16:39,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:16:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:16:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:39,893 INFO L87 Difference]: Start difference. First operand 202478 states and 334260 transitions. Second operand 7 states. [2019-09-08 10:17:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:39,446 INFO L93 Difference]: Finished difference Result 839211 states and 1386082 transitions. [2019-09-08 10:17:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:17:39,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 373 [2019-09-08 10:17:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:40,467 INFO L225 Difference]: With dead ends: 839211 [2019-09-08 10:17:40,467 INFO L226 Difference]: Without dead ends: 644553 [2019-09-08 10:17:40,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:17:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644553 states. [2019-09-08 10:18:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644553 to 642042. [2019-09-08 10:18:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642042 states. [2019-09-08 10:18:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642042 states to 642042 states and 1058650 transitions. [2019-09-08 10:18:50,646 INFO L78 Accepts]: Start accepts. Automaton has 642042 states and 1058650 transitions. Word has length 373 [2019-09-08 10:18:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:50,646 INFO L475 AbstractCegarLoop]: Abstraction has 642042 states and 1058650 transitions. [2019-09-08 10:18:50,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:18:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 642042 states and 1058650 transitions. [2019-09-08 10:18:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 10:18:50,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:50,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:50,663 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash -963672142, now seen corresponding path program 1 times [2019-09-08 10:18:50,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:50,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:50,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:51,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:51,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:18:51,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:18:51,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:18:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:18:51,653 INFO L87 Difference]: Start difference. First operand 642042 states and 1058650 transitions. Second operand 8 states.