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_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:18:36,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:18:36,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:18:36,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:18:36,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:18:36,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:18:36,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:18:36,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:18:36,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:18:36,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:18:36,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:18:36,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:18:36,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:18:36,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:18:36,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:18:36,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:18:36,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:18:36,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:18:36,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:18:36,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:18:36,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:18:36,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:18:36,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:18:36,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:18:36,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:18:36,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:18:36,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:18:36,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:18:36,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:18:36,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:18:36,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:18:36,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:18:36,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:18:36,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:18:36,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:18:36,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:18:36,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:18:36,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:18:36,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:18:36,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:18:36,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:18:36,066 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 13:18:36,082 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:18:36,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:18:36,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:18:36,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:18:36,084 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:18:36,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:18:36,085 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:18:36,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:18:36,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:18:36,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:18:36,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:18:36,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:18:36,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:18:36,086 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:18:36,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:18:36,087 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:18:36,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:18:36,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:18:36,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:18:36,087 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:18:36,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:18:36,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:18:36,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:18:36,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:18:36,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:18:36,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:18:36,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:18:36,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:18:36,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:18:36,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:18:36,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:18:36,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:18:36,147 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:18:36,147 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:18:36,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:18:36,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927581fb0/ce840e2b742648ed954cb89a9f47c27b/FLAG2a3256253 [2019-09-08 13:18:36,873 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:18:36,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:18:36,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927581fb0/ce840e2b742648ed954cb89a9f47c27b/FLAG2a3256253 [2019-09-08 13:18:37,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927581fb0/ce840e2b742648ed954cb89a9f47c27b [2019-09-08 13:18:37,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:18:37,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:18:37,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:18:37,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:18:37,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:18:37,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:18:37" (1/1) ... [2019-09-08 13:18:37,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f340cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:37, skipping insertion in model container [2019-09-08 13:18:37,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:18:37" (1/1) ... [2019-09-08 13:18:37,083 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:18:37,192 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:18:38,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:18:38,292 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:18:39,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:18:39,082 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:18:39,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39 WrapperNode [2019-09-08 13:18:39,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:18:39,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:18:39,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:18:39,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:18:39,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (1/1) ... [2019-09-08 13:18:39,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (1/1) ... [2019-09-08 13:18:39,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (1/1) ... [2019-09-08 13:18:39,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (1/1) ... [2019-09-08 13:18:39,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (1/1) ... [2019-09-08 13:18:39,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (1/1) ... [2019-09-08 13:18:39,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (1/1) ... [2019-09-08 13:18:39,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:18:39,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:18:39,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:18:39,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:18:39,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (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 13:18:39,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:18:39,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:18:39,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:18:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:18:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:18:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:18:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:18:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:18:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:18:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:18:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:18:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:18:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:18:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:18:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:18:39,379 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:18:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:18:39,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:18:39,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:18:42,051 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:18:42,051 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:18:42,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:18:42 BoogieIcfgContainer [2019-09-08 13:18:42,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:18:42,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:18:42,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:18:42,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:18:42,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:18:37" (1/3) ... [2019-09-08 13:18:42,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77396747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:18:42, skipping insertion in model container [2019-09-08 13:18:42,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:39" (2/3) ... [2019-09-08 13:18:42,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77396747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:18:42, skipping insertion in model container [2019-09-08 13:18:42,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:18:42" (3/3) ... [2019-09-08 13:18:42,060 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:18:42,070 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:18:42,080 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:18:42,100 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:18:42,175 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:18:42,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:18:42,176 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:18:42,176 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:18:42,177 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:18:42,177 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:18:42,177 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:18:42,177 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:18:42,177 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:18:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states. [2019-09-08 13:18:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:42,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:42,251 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] [2019-09-08 13:18:42,253 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash 143397951, now seen corresponding path program 1 times [2019-09-08 13:18:42,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:42,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:42,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:42,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:43,226 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 13:18:43,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:43,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:43,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:43,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:43,256 INFO L87 Difference]: Start difference. First operand 795 states. Second operand 3 states. [2019-09-08 13:18:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:43,649 INFO L93 Difference]: Finished difference Result 1490 states and 2621 transitions. [2019-09-08 13:18:43,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:43,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:18:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:43,707 INFO L225 Difference]: With dead ends: 1490 [2019-09-08 13:18:43,707 INFO L226 Difference]: Without dead ends: 1284 [2019-09-08 13:18:43,720 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 13:18:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-08 13:18:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1282. [2019-09-08 13:18:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-09-08 13:18:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 2005 transitions. [2019-09-08 13:18:43,956 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 2005 transitions. Word has length 324 [2019-09-08 13:18:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:43,962 INFO L475 AbstractCegarLoop]: Abstraction has 1282 states and 2005 transitions. [2019-09-08 13:18:43,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 2005 transitions. [2019-09-08 13:18:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:43,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:43,982 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] [2019-09-08 13:18:43,983 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1854541179, now seen corresponding path program 1 times [2019-09-08 13:18:43,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:43,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:43,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:43,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:44,433 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 13:18:44,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:44,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:44,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:44,439 INFO L87 Difference]: Start difference. First operand 1282 states and 2005 transitions. Second operand 3 states. [2019-09-08 13:18:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:44,672 INFO L93 Difference]: Finished difference Result 2612 states and 4118 transitions. [2019-09-08 13:18:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:44,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:18:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:44,691 INFO L225 Difference]: With dead ends: 2612 [2019-09-08 13:18:44,692 INFO L226 Difference]: Without dead ends: 2248 [2019-09-08 13:18:44,701 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 13:18:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-09-08 13:18:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2246. [2019-09-08 13:18:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-09-08 13:18:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3507 transitions. [2019-09-08 13:18:44,838 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3507 transitions. Word has length 324 [2019-09-08 13:18:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:44,839 INFO L475 AbstractCegarLoop]: Abstraction has 2246 states and 3507 transitions. [2019-09-08 13:18:44,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3507 transitions. [2019-09-08 13:18:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:44,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:44,855 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] [2019-09-08 13:18:44,856 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1626065980, now seen corresponding path program 1 times [2019-09-08 13:18:44,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:44,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:44,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:44,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:45,376 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 13:18:45,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:45,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:45,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:45,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:45,380 INFO L87 Difference]: Start difference. First operand 2246 states and 3507 transitions. Second operand 3 states. [2019-09-08 13:18:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:45,665 INFO L93 Difference]: Finished difference Result 4822 states and 7593 transitions. [2019-09-08 13:18:45,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:45,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:18:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:45,695 INFO L225 Difference]: With dead ends: 4822 [2019-09-08 13:18:45,695 INFO L226 Difference]: Without dead ends: 4140 [2019-09-08 13:18:45,699 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 13:18:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2019-09-08 13:18:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4138. [2019-09-08 13:18:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4138 states. [2019-09-08 13:18:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 6447 transitions. [2019-09-08 13:18:45,879 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 6447 transitions. Word has length 324 [2019-09-08 13:18:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:45,880 INFO L475 AbstractCegarLoop]: Abstraction has 4138 states and 6447 transitions. [2019-09-08 13:18:45,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6447 transitions. [2019-09-08 13:18:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:45,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:45,894 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] [2019-09-08 13:18:45,894 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -654990492, now seen corresponding path program 1 times [2019-09-08 13:18:45,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:45,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:46,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 13:18:46,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:46,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:46,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:46,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:46,893 INFO L87 Difference]: Start difference. First operand 4138 states and 6447 transitions. Second operand 4 states. [2019-09-08 13:18:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:47,461 INFO L93 Difference]: Finished difference Result 12231 states and 19038 transitions. [2019-09-08 13:18:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:47,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 13:18:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:47,521 INFO L225 Difference]: With dead ends: 12231 [2019-09-08 13:18:47,521 INFO L226 Difference]: Without dead ends: 8108 [2019-09-08 13:18:47,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:18:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8108 states. [2019-09-08 13:18:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8108 to 8106. [2019-09-08 13:18:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8106 states. [2019-09-08 13:18:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8106 states to 8106 states and 12556 transitions. [2019-09-08 13:18:47,996 INFO L78 Accepts]: Start accepts. Automaton has 8106 states and 12556 transitions. Word has length 324 [2019-09-08 13:18:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:47,997 INFO L475 AbstractCegarLoop]: Abstraction has 8106 states and 12556 transitions. [2019-09-08 13:18:47,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:18:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 8106 states and 12556 transitions. [2019-09-08 13:18:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:18:48,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:48,021 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] [2019-09-08 13:18:48,021 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:48,022 INFO L82 PathProgramCache]: Analyzing trace with hash -840226377, now seen corresponding path program 1 times [2019-09-08 13:18:48,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:48,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:48,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:48,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:48,393 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 13:18:48,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:48,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:48,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:48,395 INFO L87 Difference]: Start difference. First operand 8106 states and 12556 transitions. Second operand 3 states. [2019-09-08 13:18:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:49,053 INFO L93 Difference]: Finished difference Result 23867 states and 36904 transitions. [2019-09-08 13:18:49,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:49,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:18:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:49,161 INFO L225 Difference]: With dead ends: 23867 [2019-09-08 13:18:49,162 INFO L226 Difference]: Without dead ends: 15890 [2019-09-08 13:18:49,189 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 13:18:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15890 states. [2019-09-08 13:18:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15890 to 15888. [2019-09-08 13:18:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15888 states. [2019-09-08 13:18:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15888 states to 15888 states and 24465 transitions. [2019-09-08 13:18:49,948 INFO L78 Accepts]: Start accepts. Automaton has 15888 states and 24465 transitions. Word has length 326 [2019-09-08 13:18:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:49,949 INFO L475 AbstractCegarLoop]: Abstraction has 15888 states and 24465 transitions. [2019-09-08 13:18:49,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 15888 states and 24465 transitions. [2019-09-08 13:18:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:18:49,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:49,991 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] [2019-09-08 13:18:49,991 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1392604476, now seen corresponding path program 1 times [2019-09-08 13:18:49,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:49,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:49,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:49,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:50,199 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 13:18:50,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:50,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:50,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:50,201 INFO L87 Difference]: Start difference. First operand 15888 states and 24465 transitions. Second operand 3 states. [2019-09-08 13:18:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:51,333 INFO L93 Difference]: Finished difference Result 47589 states and 73271 transitions. [2019-09-08 13:18:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:51,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:18:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:51,423 INFO L225 Difference]: With dead ends: 47589 [2019-09-08 13:18:51,423 INFO L226 Difference]: Without dead ends: 31743 [2019-09-08 13:18:51,465 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 13:18:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31743 states. [2019-09-08 13:18:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31743 to 15907. [2019-09-08 13:18:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15907 states. [2019-09-08 13:18:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15907 states to 15907 states and 24493 transitions. [2019-09-08 13:18:52,470 INFO L78 Accepts]: Start accepts. Automaton has 15907 states and 24493 transitions. Word has length 326 [2019-09-08 13:18:52,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:52,470 INFO L475 AbstractCegarLoop]: Abstraction has 15907 states and 24493 transitions. [2019-09-08 13:18:52,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15907 states and 24493 transitions. [2019-09-08 13:18:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:18:52,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:52,512 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] [2019-09-08 13:18:52,512 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash -483333520, now seen corresponding path program 1 times [2019-09-08 13:18:52,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:52,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:52,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:52,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:52,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:52,698 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 13:18:52,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:52,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:52,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:52,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:52,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:52,701 INFO L87 Difference]: Start difference. First operand 15907 states and 24493 transitions. Second operand 3 states. [2019-09-08 13:18:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:54,532 INFO L93 Difference]: Finished difference Result 47608 states and 73292 transitions. [2019-09-08 13:18:54,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:54,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 13:18:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:54,618 INFO L225 Difference]: With dead ends: 47608 [2019-09-08 13:18:54,619 INFO L226 Difference]: Without dead ends: 31761 [2019-09-08 13:18:54,658 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 13:18:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31761 states. [2019-09-08 13:18:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31761 to 15925. [2019-09-08 13:18:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15925 states. [2019-09-08 13:18:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15925 states to 15925 states and 24514 transitions. [2019-09-08 13:18:55,727 INFO L78 Accepts]: Start accepts. Automaton has 15925 states and 24514 transitions. Word has length 327 [2019-09-08 13:18:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:55,727 INFO L475 AbstractCegarLoop]: Abstraction has 15925 states and 24514 transitions. [2019-09-08 13:18:55,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 15925 states and 24514 transitions. [2019-09-08 13:18:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:18:55,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:55,759 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] [2019-09-08 13:18:55,760 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1336838194, now seen corresponding path program 1 times [2019-09-08 13:18:55,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:55,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:55,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:56,104 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 13:18:56,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:56,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:56,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:56,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:56,107 INFO L87 Difference]: Start difference. First operand 15925 states and 24514 transitions. Second operand 3 states. [2019-09-08 13:18:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:57,224 INFO L93 Difference]: Finished difference Result 45116 states and 69305 transitions. [2019-09-08 13:18:57,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:57,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 13:18:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:57,461 INFO L225 Difference]: With dead ends: 45116 [2019-09-08 13:18:57,462 INFO L226 Difference]: Without dead ends: 29436 [2019-09-08 13:18:57,512 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 13:18:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29436 states. [2019-09-08 13:18:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29436 to 29434. [2019-09-08 13:18:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29434 states. [2019-09-08 13:18:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29434 states to 29434 states and 44988 transitions. [2019-09-08 13:18:58,785 INFO L78 Accepts]: Start accepts. Automaton has 29434 states and 44988 transitions. Word has length 328 [2019-09-08 13:18:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:58,786 INFO L475 AbstractCegarLoop]: Abstraction has 29434 states and 44988 transitions. [2019-09-08 13:18:58,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 29434 states and 44988 transitions. [2019-09-08 13:18:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:18:58,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:58,846 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] [2019-09-08 13:18:58,846 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:58,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:58,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1152108785, now seen corresponding path program 1 times [2019-09-08 13:18:58,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:58,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:58,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:58,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:58,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:59,528 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 13:18:59,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:59,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:59,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:59,531 INFO L87 Difference]: Start difference. First operand 29434 states and 44988 transitions. Second operand 4 states. [2019-09-08 13:19:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:02,188 INFO L93 Difference]: Finished difference Result 85481 states and 130456 transitions. [2019-09-08 13:19:02,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:19:02,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 13:19:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:02,309 INFO L225 Difference]: With dead ends: 85481 [2019-09-08 13:19:02,310 INFO L226 Difference]: Without dead ends: 56587 [2019-09-08 13:19:02,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:19:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56587 states. [2019-09-08 13:19:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56587 to 29669. [2019-09-08 13:19:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29669 states. [2019-09-08 13:19:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29669 states to 29669 states and 45376 transitions. [2019-09-08 13:19:03,916 INFO L78 Accepts]: Start accepts. Automaton has 29669 states and 45376 transitions. Word has length 328 [2019-09-08 13:19:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:03,917 INFO L475 AbstractCegarLoop]: Abstraction has 29669 states and 45376 transitions. [2019-09-08 13:19:03,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:19:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 29669 states and 45376 transitions. [2019-09-08 13:19:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:19:03,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:03,950 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] [2019-09-08 13:19:03,950 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:03,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:03,951 INFO L82 PathProgramCache]: Analyzing trace with hash -453644434, now seen corresponding path program 1 times [2019-09-08 13:19:03,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:03,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:03,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:03,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:03,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:04,125 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 13:19:04,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:04,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:04,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:04,127 INFO L87 Difference]: Start difference. First operand 29669 states and 45376 transitions. Second operand 3 states. [2019-09-08 13:19:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:06,036 INFO L93 Difference]: Finished difference Result 74993 states and 115452 transitions. [2019-09-08 13:19:06,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:06,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:19:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:06,129 INFO L225 Difference]: With dead ends: 74993 [2019-09-08 13:19:06,129 INFO L226 Difference]: Without dead ends: 47087 [2019-09-08 13:19:06,168 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 13:19:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47087 states. [2019-09-08 13:19:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47087 to 37025. [2019-09-08 13:19:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37025 states. [2019-09-08 13:19:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37025 states to 37025 states and 57490 transitions. [2019-09-08 13:19:08,780 INFO L78 Accepts]: Start accepts. Automaton has 37025 states and 57490 transitions. Word has length 330 [2019-09-08 13:19:08,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:08,780 INFO L475 AbstractCegarLoop]: Abstraction has 37025 states and 57490 transitions. [2019-09-08 13:19:08,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 37025 states and 57490 transitions. [2019-09-08 13:19:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:19:08,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:08,815 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] [2019-09-08 13:19:08,815 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1877340163, now seen corresponding path program 1 times [2019-09-08 13:19:08,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:08,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:08,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:08,964 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 13:19:08,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:08,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:08,966 INFO L87 Difference]: Start difference. First operand 37025 states and 57490 transitions. Second operand 3 states. [2019-09-08 13:19:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:11,385 INFO L93 Difference]: Finished difference Result 109505 states and 169751 transitions. [2019-09-08 13:19:11,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:11,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:19:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:11,558 INFO L225 Difference]: With dead ends: 109505 [2019-09-08 13:19:11,559 INFO L226 Difference]: Without dead ends: 73283 [2019-09-08 13:19:11,624 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 13:19:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73283 states. [2019-09-08 13:19:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73283 to 37129. [2019-09-08 13:19:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37129 states. [2019-09-08 13:19:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37129 states to 37129 states and 57633 transitions. [2019-09-08 13:19:13,537 INFO L78 Accepts]: Start accepts. Automaton has 37129 states and 57633 transitions. Word has length 330 [2019-09-08 13:19:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:13,537 INFO L475 AbstractCegarLoop]: Abstraction has 37129 states and 57633 transitions. [2019-09-08 13:19:13,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 37129 states and 57633 transitions. [2019-09-08 13:19:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:19:13,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:13,565 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] [2019-09-08 13:19:13,566 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash -804422415, now seen corresponding path program 1 times [2019-09-08 13:19:13,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:13,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:13,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:13,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:13,710 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 13:19:13,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:13,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:13,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:13,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:13,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:13,713 INFO L87 Difference]: Start difference. First operand 37129 states and 57633 transitions. Second operand 3 states. [2019-09-08 13:19:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:17,217 INFO L93 Difference]: Finished difference Result 109637 states and 169917 transitions. [2019-09-08 13:19:17,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:17,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 13:19:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:17,298 INFO L225 Difference]: With dead ends: 109637 [2019-09-08 13:19:17,298 INFO L226 Difference]: Without dead ends: 73408 [2019-09-08 13:19:17,337 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 13:19:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73408 states. [2019-09-08 13:19:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73408 to 37254. [2019-09-08 13:19:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37254 states. [2019-09-08 13:19:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37254 states to 37254 states and 57779 transitions. [2019-09-08 13:19:19,295 INFO L78 Accepts]: Start accepts. Automaton has 37254 states and 57779 transitions. Word has length 331 [2019-09-08 13:19:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:19,295 INFO L475 AbstractCegarLoop]: Abstraction has 37254 states and 57779 transitions. [2019-09-08 13:19:19,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 37254 states and 57779 transitions. [2019-09-08 13:19:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:19:19,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:19,323 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] [2019-09-08 13:19:19,324 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash 536139505, now seen corresponding path program 1 times [2019-09-08 13:19:19,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:19,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:19,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:19,488 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 13:19:19,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:19,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:19,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:19,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:19,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:19,490 INFO L87 Difference]: Start difference. First operand 37254 states and 57779 transitions. Second operand 3 states. [2019-09-08 13:19:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:22,216 INFO L93 Difference]: Finished difference Result 93350 states and 145911 transitions. [2019-09-08 13:19:22,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:22,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:19:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:22,324 INFO L225 Difference]: With dead ends: 93350 [2019-09-08 13:19:22,325 INFO L226 Difference]: Without dead ends: 58400 [2019-09-08 13:19:22,375 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 13:19:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58400 states. [2019-09-08 13:19:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58400 to 50446. [2019-09-08 13:19:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50446 states. [2019-09-08 13:19:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50446 states to 50446 states and 79409 transitions. [2019-09-08 13:19:26,185 INFO L78 Accepts]: Start accepts. Automaton has 50446 states and 79409 transitions. Word has length 332 [2019-09-08 13:19:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:26,186 INFO L475 AbstractCegarLoop]: Abstraction has 50446 states and 79409 transitions. [2019-09-08 13:19:26,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 50446 states and 79409 transitions. [2019-09-08 13:19:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:19:26,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:26,207 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] [2019-09-08 13:19:26,207 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1245793770, now seen corresponding path program 1 times [2019-09-08 13:19:26,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:26,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:26,616 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 13:19:26,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:26,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:19:26,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:19:26,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:19:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:19:26,618 INFO L87 Difference]: Start difference. First operand 50446 states and 79409 transitions. Second operand 4 states. [2019-09-08 13:19:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:28,934 INFO L93 Difference]: Finished difference Result 96721 states and 152140 transitions. [2019-09-08 13:19:28,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:19:28,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 13:19:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:28,990 INFO L225 Difference]: With dead ends: 96721 [2019-09-08 13:19:28,991 INFO L226 Difference]: Without dead ends: 47138 [2019-09-08 13:19:29,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:19:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47138 states. [2019-09-08 13:19:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47138 to 47118. [2019-09-08 13:19:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47118 states. [2019-09-08 13:19:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 74148 transitions. [2019-09-08 13:19:31,144 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 74148 transitions. Word has length 332 [2019-09-08 13:19:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:31,145 INFO L475 AbstractCegarLoop]: Abstraction has 47118 states and 74148 transitions. [2019-09-08 13:19:31,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:19:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 74148 transitions. [2019-09-08 13:19:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:19:31,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:31,167 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] [2019-09-08 13:19:31,167 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1110227113, now seen corresponding path program 1 times [2019-09-08 13:19:31,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:31,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:31,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:31,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:31,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:31,992 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 13:19:31,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:31,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 13:19:31,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:19:31,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:19:31,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:19:31,995 INFO L87 Difference]: Start difference. First operand 47118 states and 74148 transitions. Second operand 10 states. [2019-09-08 13:19:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:42,383 INFO L93 Difference]: Finished difference Result 201335 states and 322110 transitions. [2019-09-08 13:19:42,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:19:42,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 333 [2019-09-08 13:19:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:42,607 INFO L225 Difference]: With dead ends: 201335 [2019-09-08 13:19:42,607 INFO L226 Difference]: Without dead ends: 156054 [2019-09-08 13:19:42,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-08 13:19:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156054 states. [2019-09-08 13:19:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156054 to 90862. [2019-09-08 13:19:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90862 states. [2019-09-08 13:19:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90862 states to 90862 states and 143417 transitions. [2019-09-08 13:19:50,127 INFO L78 Accepts]: Start accepts. Automaton has 90862 states and 143417 transitions. Word has length 333 [2019-09-08 13:19:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:50,128 INFO L475 AbstractCegarLoop]: Abstraction has 90862 states and 143417 transitions. [2019-09-08 13:19:50,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 13:19:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 90862 states and 143417 transitions. [2019-09-08 13:19:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:19:50,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:50,154 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] [2019-09-08 13:19:50,154 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1551200824, now seen corresponding path program 1 times [2019-09-08 13:19:50,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:51,059 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 13:19:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:19:51,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:19:51,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:19:51,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:19:51,064 INFO L87 Difference]: Start difference. First operand 90862 states and 143417 transitions. Second operand 4 states. [2019-09-08 13:20:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:03,301 INFO L93 Difference]: Finished difference Result 268249 states and 423389 transitions. [2019-09-08 13:20:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:20:03,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-09-08 13:20:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:03,532 INFO L225 Difference]: With dead ends: 268249 [2019-09-08 13:20:03,532 INFO L226 Difference]: Without dead ends: 177459 [2019-09-08 13:20:03,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:20:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177459 states. [2019-09-08 13:20:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177459 to 177457. [2019-09-08 13:20:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177457 states. [2019-09-08 13:20:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177457 states to 177457 states and 278791 transitions. [2019-09-08 13:20:17,902 INFO L78 Accepts]: Start accepts. Automaton has 177457 states and 278791 transitions. Word has length 333 [2019-09-08 13:20:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:17,903 INFO L475 AbstractCegarLoop]: Abstraction has 177457 states and 278791 transitions. [2019-09-08 13:20:17,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:20:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 177457 states and 278791 transitions. [2019-09-08 13:20:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 13:20:17,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:17,949 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] [2019-09-08 13:20:17,949 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1328429672, now seen corresponding path program 1 times [2019-09-08 13:20:17,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:17,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:17,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:18,233 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 13:20:18,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:18,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:18,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:18,235 INFO L87 Difference]: Start difference. First operand 177457 states and 278791 transitions. Second operand 3 states. [2019-09-08 13:20:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:40,876 INFO L93 Difference]: Finished difference Result 523949 states and 823375 transitions. [2019-09-08 13:20:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:40,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-08 13:20:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:41,385 INFO L225 Difference]: With dead ends: 523949 [2019-09-08 13:20:41,385 INFO L226 Difference]: Without dead ends: 347741 [2019-09-08 13:20:41,536 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 13:20:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347741 states. [2019-09-08 13:21:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347741 to 347739. [2019-09-08 13:21:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347739 states. [2019-09-08 13:21:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347739 states to 347739 states and 544512 transitions. [2019-09-08 13:21:09,790 INFO L78 Accepts]: Start accepts. Automaton has 347739 states and 544512 transitions. Word has length 335 [2019-09-08 13:21:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:09,790 INFO L475 AbstractCegarLoop]: Abstraction has 347739 states and 544512 transitions. [2019-09-08 13:21:09,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 347739 states and 544512 transitions. [2019-09-08 13:21:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:21:09,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:09,897 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] [2019-09-08 13:21:09,897 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:09,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash 519055583, now seen corresponding path program 1 times [2019-09-08 13:21:09,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:09,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:09,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:09,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:09,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:10,077 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 13:21:10,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:10,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:10,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:10,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:10,079 INFO L87 Difference]: Start difference. First operand 347739 states and 544512 transitions. Second operand 3 states. [2019-09-08 13:21:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:58,032 INFO L93 Difference]: Finished difference Result 937779 states and 1478962 transitions. [2019-09-08 13:21:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:58,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-08 13:21:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:58,930 INFO L225 Difference]: With dead ends: 937779 [2019-09-08 13:21:58,930 INFO L226 Difference]: Without dead ends: 597229 [2019-09-08 13:21:59,202 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 13:21:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597229 states. [2019-09-08 13:22:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597229 to 548859. [2019-09-08 13:22:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548859 states. [2019-09-08 13:22:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548859 states to 548859 states and 863080 transitions. [2019-09-08 13:22:54,795 INFO L78 Accepts]: Start accepts. Automaton has 548859 states and 863080 transitions. Word has length 336 [2019-09-08 13:22:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:54,795 INFO L475 AbstractCegarLoop]: Abstraction has 548859 states and 863080 transitions. [2019-09-08 13:22:54,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:22:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 548859 states and 863080 transitions. [2019-09-08 13:22:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 13:22:54,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:54,919 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] [2019-09-08 13:22:54,920 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1402597133, now seen corresponding path program 1 times [2019-09-08 13:22:54,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:54,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:54,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:55,172 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 13:22:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:55,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:55,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:55,175 INFO L87 Difference]: Start difference. First operand 548859 states and 863080 transitions. Second operand 3 states. [2019-09-08 13:24:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:24:19,848 INFO L93 Difference]: Finished difference Result 1562698 states and 2455698 transitions. [2019-09-08 13:24:19,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:24:19,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-08 13:24:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:24:21,793 INFO L225 Difference]: With dead ends: 1562698 [2019-09-08 13:24:21,793 INFO L226 Difference]: Without dead ends: 1015186 [2019-09-08 13:24:22,322 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 13:24:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015186 states. [2019-09-08 13:26:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015186 to 1015184. [2019-09-08 13:26:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015184 states. [2019-09-08 13:26:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015184 states to 1015184 states and 1585893 transitions. [2019-09-08 13:26:17,988 INFO L78 Accepts]: Start accepts. Automaton has 1015184 states and 1585893 transitions. Word has length 337 [2019-09-08 13:26:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:17,988 INFO L475 AbstractCegarLoop]: Abstraction has 1015184 states and 1585893 transitions. [2019-09-08 13:26:17,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1015184 states and 1585893 transitions. [2019-09-08 13:26:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 13:26:18,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:18,161 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] [2019-09-08 13:26:18,161 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:18,162 INFO L82 PathProgramCache]: Analyzing trace with hash 775437712, now seen corresponding path program 1 times [2019-09-08 13:26:18,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:18,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:18,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:18,543 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 13:26:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:18,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:18,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:18,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:18,545 INFO L87 Difference]: Start difference. First operand 1015184 states and 1585893 transitions. Second operand 4 states. [2019-09-08 13:29:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:07,818 INFO L93 Difference]: Finished difference Result 2793454 states and 4357326 transitions. [2019-09-08 13:29:07,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:07,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-09-08 13:29:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:11,215 INFO L225 Difference]: With dead ends: 2793454 [2019-09-08 13:29:11,215 INFO L226 Difference]: Without dead ends: 1781562 [2019-09-08 13:29:12,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:29:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781562 states.