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.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:39:44,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:39:44,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:39:44,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:39:44,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:39:44,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:39:44,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:39:44,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:39:44,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:39:44,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:39:44,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:39:44,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:39:44,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:39:44,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:39:44,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:39:44,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:39:44,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:39:44,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:39:44,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:39:44,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:39:44,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:39:44,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:39:44,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:39:44,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:39:44,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:39:44,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:39:44,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:39:44,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:39:44,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:39:44,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:39:44,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:39:44,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:39:44,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:39:44,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:39:44,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:39:44,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:39:44,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:39:44,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:39:44,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:39:44,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:39:44,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:39:44,273 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:39:44,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:39:44,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:39:44,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:39:44,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:39:44,302 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:39:44,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:39:44,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:39:44,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:39:44,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:39:44,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:39:44,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:39:44,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:39:44,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:39:44,304 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:39:44,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:39:44,304 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:39:44,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:39:44,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:39:44,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:39:44,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:39:44,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:39:44,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:39:44,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:39:44,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:39:44,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:39:44,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:39:44,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:39:44,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:39:44,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:39:44,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:39:44,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:39:44,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:39:44,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:39:44,357 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:39:44,357 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.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:39:44,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8969997/e32158e349754b6480c580896560e235/FLAG64f9d56db [2019-09-08 13:39:45,062 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:39:45,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:39:45,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8969997/e32158e349754b6480c580896560e235/FLAG64f9d56db [2019-09-08 13:39:45,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8969997/e32158e349754b6480c580896560e235 [2019-09-08 13:39:45,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:39:45,268 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:39:45,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:39:45,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:39:45,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:39:45,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:39:45" (1/1) ... [2019-09-08 13:39:45,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8f9913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:45, skipping insertion in model container [2019-09-08 13:39:45,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:39:45" (1/1) ... [2019-09-08 13:39:45,292 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:39:45,420 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:39:46,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:39:46,137 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:39:46,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:39:46,588 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:39:46,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46 WrapperNode [2019-09-08 13:39:46,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:39:46,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:39:46,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:39:46,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:39:46,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (1/1) ... [2019-09-08 13:39:46,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (1/1) ... [2019-09-08 13:39:46,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (1/1) ... [2019-09-08 13:39:46,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (1/1) ... [2019-09-08 13:39:46,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (1/1) ... [2019-09-08 13:39:46,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (1/1) ... [2019-09-08 13:39:46,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (1/1) ... [2019-09-08 13:39:46,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:39:46,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:39:46,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:39:46,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:39:46,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (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:39:46,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:39:46,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:39:46,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:39:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:39:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:39:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:39:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:39:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:39:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:39:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:39:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:39:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:39:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:39:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:39:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:39:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:39:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:39:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:39:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:39:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:39:49,230 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:39:49,232 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:39:49,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:39:49 BoogieIcfgContainer [2019-09-08 13:39:49,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:39:49,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:39:49,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:39:49,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:39:49,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:39:45" (1/3) ... [2019-09-08 13:39:49,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4a5193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:39:49, skipping insertion in model container [2019-09-08 13:39:49,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:46" (2/3) ... [2019-09-08 13:39:49,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4a5193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:39:49, skipping insertion in model container [2019-09-08 13:39:49,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:39:49" (3/3) ... [2019-09-08 13:39:49,244 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:39:49,254 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:39:49,280 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:39:49,303 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:39:49,347 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:39:49,348 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:39:49,348 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:39:49,348 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:39:49,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:39:49,349 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:39:49,349 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:39:49,349 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:39:49,349 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:39:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2019-09-08 13:39:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 13:39:49,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:49,429 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] [2019-09-08 13:39:49,432 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:49,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1832108402, now seen corresponding path program 1 times [2019-09-08 13:39:49,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:49,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:49,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:49,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:50,192 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:39:50,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:50,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:50,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:50,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:50,218 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2019-09-08 13:39:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:50,477 INFO L93 Difference]: Finished difference Result 1207 states and 2146 transitions. [2019-09-08 13:39:50,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:50,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-08 13:39:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:50,531 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 13:39:50,536 INFO L226 Difference]: Without dead ends: 976 [2019-09-08 13:39:50,544 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:39:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-08 13:39:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-09-08 13:39:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-08 13:39:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1686 transitions. [2019-09-08 13:39:50,693 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1686 transitions. Word has length 217 [2019-09-08 13:39:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:50,698 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1686 transitions. [2019-09-08 13:39:50,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1686 transitions. [2019-09-08 13:39:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 13:39:50,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:50,703 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] [2019-09-08 13:39:50,704 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash 475136375, now seen corresponding path program 1 times [2019-09-08 13:39:50,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:50,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:50,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:50,972 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:39:50,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:50,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:50,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:50,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:50,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:50,978 INFO L87 Difference]: Start difference. First operand 974 states and 1686 transitions. Second operand 3 states. [2019-09-08 13:39:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:51,045 INFO L93 Difference]: Finished difference Result 1794 states and 3070 transitions. [2019-09-08 13:39:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:51,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-08 13:39:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:51,059 INFO L225 Difference]: With dead ends: 1794 [2019-09-08 13:39:51,059 INFO L226 Difference]: Without dead ends: 1372 [2019-09-08 13:39:51,066 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:39:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-09-08 13:39:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2019-09-08 13:39:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2019-09-08 13:39:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2353 transitions. [2019-09-08 13:39:51,139 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2353 transitions. Word has length 221 [2019-09-08 13:39:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:51,140 INFO L475 AbstractCegarLoop]: Abstraction has 1370 states and 2353 transitions. [2019-09-08 13:39:51,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2353 transitions. [2019-09-08 13:39:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 13:39:51,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:51,147 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] [2019-09-08 13:39:51,147 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash 172719100, now seen corresponding path program 1 times [2019-09-08 13:39:51,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:51,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:51,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:39:51,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:51,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:51,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:51,513 INFO L87 Difference]: Start difference. First operand 1370 states and 2353 transitions. Second operand 3 states. [2019-09-08 13:39:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:51,586 INFO L93 Difference]: Finished difference Result 2958 states and 5027 transitions. [2019-09-08 13:39:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:51,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-08 13:39:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:51,598 INFO L225 Difference]: With dead ends: 2958 [2019-09-08 13:39:51,599 INFO L226 Difference]: Without dead ends: 2140 [2019-09-08 13:39:51,601 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:39:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-09-08 13:39:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-09-08 13:39:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-09-08 13:39:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3641 transitions. [2019-09-08 13:39:51,670 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3641 transitions. Word has length 225 [2019-09-08 13:39:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:51,671 INFO L475 AbstractCegarLoop]: Abstraction has 2138 states and 3641 transitions. [2019-09-08 13:39:51,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3641 transitions. [2019-09-08 13:39:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 13:39:51,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:51,677 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] [2019-09-08 13:39:51,678 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:51,678 INFO L82 PathProgramCache]: Analyzing trace with hash 300878849, now seen corresponding path program 1 times [2019-09-08 13:39:51,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:51,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:51,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:51,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:39:51,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:51,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:51,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:51,893 INFO L87 Difference]: Start difference. First operand 2138 states and 3641 transitions. Second operand 3 states. [2019-09-08 13:39:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:52,005 INFO L93 Difference]: Finished difference Result 5214 states and 8803 transitions. [2019-09-08 13:39:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:52,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 13:39:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:52,025 INFO L225 Difference]: With dead ends: 5214 [2019-09-08 13:39:52,025 INFO L226 Difference]: Without dead ends: 3628 [2019-09-08 13:39:52,030 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:39:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-09-08 13:39:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3626. [2019-09-08 13:39:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3626 states. [2019-09-08 13:39:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 6125 transitions. [2019-09-08 13:39:52,211 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 6125 transitions. Word has length 229 [2019-09-08 13:39:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:52,212 INFO L475 AbstractCegarLoop]: Abstraction has 3626 states and 6125 transitions. [2019-09-08 13:39:52,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 6125 transitions. [2019-09-08 13:39:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 13:39:52,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:52,219 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] [2019-09-08 13:39:52,219 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash 7408774, now seen corresponding path program 1 times [2019-09-08 13:39:52,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:52,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:52,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:52,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:52,408 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:39:52,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:52,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:52,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:52,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:52,410 INFO L87 Difference]: Start difference. First operand 3626 states and 6125 transitions. Second operand 3 states. [2019-09-08 13:39:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:52,676 INFO L93 Difference]: Finished difference Result 9582 states and 16079 transitions. [2019-09-08 13:39:52,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:52,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 13:39:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:52,720 INFO L225 Difference]: With dead ends: 9582 [2019-09-08 13:39:52,720 INFO L226 Difference]: Without dead ends: 6508 [2019-09-08 13:39:52,735 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:39:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2019-09-08 13:39:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6506. [2019-09-08 13:39:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-09-08 13:39:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10909 transitions. [2019-09-08 13:39:53,074 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10909 transitions. Word has length 233 [2019-09-08 13:39:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:53,075 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 10909 transitions. [2019-09-08 13:39:53,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10909 transitions. [2019-09-08 13:39:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 13:39:53,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:53,089 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] [2019-09-08 13:39:53,089 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1561634677, now seen corresponding path program 1 times [2019-09-08 13:39:53,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:53,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:53,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:53,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:53,635 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:39:53,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:53,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:39:53,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:39:53,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:39:53,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:39:53,637 INFO L87 Difference]: Start difference. First operand 6506 states and 10909 transitions. Second operand 7 states. [2019-09-08 13:39:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:55,594 INFO L93 Difference]: Finished difference Result 39713 states and 66613 transitions. [2019-09-08 13:39:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 13:39:55,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2019-09-08 13:39:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:55,741 INFO L225 Difference]: With dead ends: 39713 [2019-09-08 13:39:55,741 INFO L226 Difference]: Without dead ends: 33759 [2019-09-08 13:39:55,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 13:39:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33759 states. [2019-09-08 13:39:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33759 to 12303. [2019-09-08 13:39:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-09-08 13:39:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 20548 transitions. [2019-09-08 13:39:57,403 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 20548 transitions. Word has length 237 [2019-09-08 13:39:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:57,404 INFO L475 AbstractCegarLoop]: Abstraction has 12303 states and 20548 transitions. [2019-09-08 13:39:57,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:39:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 20548 transitions. [2019-09-08 13:39:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 13:39:57,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:57,414 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] [2019-09-08 13:39:57,414 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1236760728, now seen corresponding path program 1 times [2019-09-08 13:39:57,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:57,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:57,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:57,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:57,612 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:39:57,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:57,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:39:57,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:39:57,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:39:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:39:57,615 INFO L87 Difference]: Start difference. First operand 12303 states and 20548 transitions. Second operand 4 states. [2019-09-08 13:39:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:58,684 INFO L93 Difference]: Finished difference Result 32984 states and 55182 transitions. [2019-09-08 13:39:58,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:39:58,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-08 13:39:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:58,743 INFO L225 Difference]: With dead ends: 32984 [2019-09-08 13:39:58,743 INFO L226 Difference]: Without dead ends: 21233 [2019-09-08 13:39:58,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:39:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21233 states. [2019-09-08 13:39:59,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21233 to 18279. [2019-09-08 13:39:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-09-08 13:39:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 30544 transitions. [2019-09-08 13:39:59,681 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 30544 transitions. Word has length 238 [2019-09-08 13:39:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:59,682 INFO L475 AbstractCegarLoop]: Abstraction has 18279 states and 30544 transitions. [2019-09-08 13:39:59,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:39:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 30544 transitions. [2019-09-08 13:39:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:39:59,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:59,696 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] [2019-09-08 13:39:59,696 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:59,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:59,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1598097195, now seen corresponding path program 1 times [2019-09-08 13:39:59,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:59,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:59,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:39:59,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:59,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:59,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:59,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:59,985 INFO L87 Difference]: Start difference. First operand 18279 states and 30544 transitions. Second operand 3 states. [2019-09-08 13:40:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:00,866 INFO L93 Difference]: Finished difference Result 40226 states and 67370 transitions. [2019-09-08 13:40:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:00,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:40:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:00,943 INFO L225 Difference]: With dead ends: 40226 [2019-09-08 13:40:00,943 INFO L226 Difference]: Without dead ends: 28072 [2019-09-08 13:40:00,983 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:40:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28072 states. [2019-09-08 13:40:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28072 to 28070. [2019-09-08 13:40:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28070 states. [2019-09-08 13:40:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28070 states to 28070 states and 46877 transitions. [2019-09-08 13:40:02,116 INFO L78 Accepts]: Start accepts. Automaton has 28070 states and 46877 transitions. Word has length 239 [2019-09-08 13:40:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:02,117 INFO L475 AbstractCegarLoop]: Abstraction has 28070 states and 46877 transitions. [2019-09-08 13:40:02,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28070 states and 46877 transitions. [2019-09-08 13:40:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:40:02,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:02,124 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] [2019-09-08 13:40:02,125 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:02,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1621339669, now seen corresponding path program 1 times [2019-09-08 13:40:02,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:02,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:02,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:02,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:02,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:02,404 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:40:02,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:02,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:02,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:02,406 INFO L87 Difference]: Start difference. First operand 28070 states and 46877 transitions. Second operand 3 states. [2019-09-08 13:40:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:04,261 INFO L93 Difference]: Finished difference Result 53990 states and 90204 transitions. [2019-09-08 13:40:04,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:04,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:40:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:04,339 INFO L225 Difference]: With dead ends: 53990 [2019-09-08 13:40:04,340 INFO L226 Difference]: Without dead ends: 39524 [2019-09-08 13:40:04,368 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:40:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39524 states. [2019-09-08 13:40:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39524 to 39522. [2019-09-08 13:40:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-09-08 13:40:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 65881 transitions. [2019-09-08 13:40:05,931 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 65881 transitions. Word has length 239 [2019-09-08 13:40:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:05,932 INFO L475 AbstractCegarLoop]: Abstraction has 39522 states and 65881 transitions. [2019-09-08 13:40:05,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 65881 transitions. [2019-09-08 13:40:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:40:05,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:05,937 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] [2019-09-08 13:40:05,937 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash -839265151, now seen corresponding path program 1 times [2019-09-08 13:40:05,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:05,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:05,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:06,121 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:40:06,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:06,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:06,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:06,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:06,123 INFO L87 Difference]: Start difference. First operand 39522 states and 65881 transitions. Second operand 3 states. [2019-09-08 13:40:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:07,788 INFO L93 Difference]: Finished difference Result 75826 states and 126488 transitions. [2019-09-08 13:40:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:07,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:40:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:07,863 INFO L225 Difference]: With dead ends: 75826 [2019-09-08 13:40:07,864 INFO L226 Difference]: Without dead ends: 55408 [2019-09-08 13:40:07,901 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:40:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55408 states. [2019-09-08 13:40:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55408 to 55406. [2019-09-08 13:40:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55406 states. [2019-09-08 13:40:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55406 states to 55406 states and 92185 transitions. [2019-09-08 13:40:10,952 INFO L78 Accepts]: Start accepts. Automaton has 55406 states and 92185 transitions. Word has length 239 [2019-09-08 13:40:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:10,953 INFO L475 AbstractCegarLoop]: Abstraction has 55406 states and 92185 transitions. [2019-09-08 13:40:10,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 55406 states and 92185 transitions. [2019-09-08 13:40:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:40:10,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:10,957 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] [2019-09-08 13:40:10,957 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1472495767, now seen corresponding path program 1 times [2019-09-08 13:40:10,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:11,160 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:40:11,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:11,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:11,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:11,162 INFO L87 Difference]: Start difference. First operand 55406 states and 92185 transitions. Second operand 3 states. [2019-09-08 13:40:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:13,493 INFO L93 Difference]: Finished difference Result 106006 states and 176532 transitions. [2019-09-08 13:40:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:13,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:40:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:13,594 INFO L225 Difference]: With dead ends: 106006 [2019-09-08 13:40:13,595 INFO L226 Difference]: Without dead ends: 77300 [2019-09-08 13:40:13,631 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:40:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77300 states. [2019-09-08 13:40:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77300 to 77298. [2019-09-08 13:40:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77298 states. [2019-09-08 13:40:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77298 states to 77298 states and 128349 transitions. [2019-09-08 13:40:17,568 INFO L78 Accepts]: Start accepts. Automaton has 77298 states and 128349 transitions. Word has length 239 [2019-09-08 13:40:17,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:17,568 INFO L475 AbstractCegarLoop]: Abstraction has 77298 states and 128349 transitions. [2019-09-08 13:40:17,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 77298 states and 128349 transitions. [2019-09-08 13:40:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:40:17,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:17,571 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] [2019-09-08 13:40:17,571 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash 141121069, now seen corresponding path program 1 times [2019-09-08 13:40:17,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:17,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:17,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:17,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:17,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:17,751 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:40:17,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:17,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:17,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:17,753 INFO L87 Difference]: Start difference. First operand 77298 states and 128349 transitions. Second operand 3 states. [2019-09-08 13:40:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:22,256 INFO L93 Difference]: Finished difference Result 147422 states and 245036 transitions. [2019-09-08 13:40:22,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:22,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:40:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:22,400 INFO L225 Difference]: With dead ends: 147422 [2019-09-08 13:40:22,400 INFO L226 Difference]: Without dead ends: 107244 [2019-09-08 13:40:22,448 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:40:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107244 states. [2019-09-08 13:40:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107244 to 107242. [2019-09-08 13:40:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107242 states. [2019-09-08 13:40:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107242 states to 107242 states and 177668 transitions. [2019-09-08 13:40:26,060 INFO L78 Accepts]: Start accepts. Automaton has 107242 states and 177668 transitions. Word has length 239 [2019-09-08 13:40:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:26,061 INFO L475 AbstractCegarLoop]: Abstraction has 107242 states and 177668 transitions. [2019-09-08 13:40:26,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 107242 states and 177668 transitions. [2019-09-08 13:40:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:40:26,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:26,064 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] [2019-09-08 13:40:26,064 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:26,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash 248955122, now seen corresponding path program 1 times [2019-09-08 13:40:26,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:26,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:26,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:26,266 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:40:26,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:26,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:40:26,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:40:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:40:26,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:40:26,268 INFO L87 Difference]: Start difference. First operand 107242 states and 177668 transitions. Second operand 4 states. [2019-09-08 13:40:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:34,455 INFO L93 Difference]: Finished difference Result 317228 states and 526154 transitions. [2019-09-08 13:40:34,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:40:34,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-08 13:40:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:34,849 INFO L225 Difference]: With dead ends: 317228 [2019-09-08 13:40:34,849 INFO L226 Difference]: Without dead ends: 210652 [2019-09-08 13:40:34,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:40:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210652 states. [2019-09-08 13:40:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210652 to 176201. [2019-09-08 13:40:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176201 states. [2019-09-08 13:40:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176201 states to 176201 states and 291287 transitions. [2019-09-08 13:40:45,461 INFO L78 Accepts]: Start accepts. Automaton has 176201 states and 291287 transitions. Word has length 239 [2019-09-08 13:40:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:45,461 INFO L475 AbstractCegarLoop]: Abstraction has 176201 states and 291287 transitions. [2019-09-08 13:40:45,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:40:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 176201 states and 291287 transitions. [2019-09-08 13:40:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 13:40:45,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:45,463 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] [2019-09-08 13:40:45,463 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash -933935761, now seen corresponding path program 1 times [2019-09-08 13:40:45,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:45,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:45,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:45,755 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:40:45,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:45,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:40:45,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:40:45,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:40:45,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:40:45,759 INFO L87 Difference]: Start difference. First operand 176201 states and 291287 transitions. Second operand 4 states. [2019-09-08 13:41:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:41:02,126 INFO L93 Difference]: Finished difference Result 522932 states and 865508 transitions. [2019-09-08 13:41:02,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:41:02,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 13:41:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:41:02,734 INFO L225 Difference]: With dead ends: 522932 [2019-09-08 13:41:02,735 INFO L226 Difference]: Without dead ends: 347397 [2019-09-08 13:41:02,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:41:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347397 states. [2019-09-08 13:41:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347397 to 289052. [2019-09-08 13:41:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289052 states. [2019-09-08 13:41:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289052 states to 289052 states and 476834 transitions. [2019-09-08 13:41:21,278 INFO L78 Accepts]: Start accepts. Automaton has 289052 states and 476834 transitions. Word has length 240 [2019-09-08 13:41:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:21,278 INFO L475 AbstractCegarLoop]: Abstraction has 289052 states and 476834 transitions. [2019-09-08 13:41:21,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:41:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 289052 states and 476834 transitions. [2019-09-08 13:41:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:41:21,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:21,280 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] [2019-09-08 13:41:21,280 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:21,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1055710553, now seen corresponding path program 1 times [2019-09-08 13:41:21,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:21,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:21,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:21,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:21,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:21,453 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:41:21,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:21,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:41:21,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:41:21,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:41:21,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:41:21,454 INFO L87 Difference]: Start difference. First operand 289052 states and 476834 transitions. Second operand 4 states. [2019-09-08 13:41:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:41:47,668 INFO L93 Difference]: Finished difference Result 849884 states and 1403882 transitions. [2019-09-08 13:41:47,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:41:47,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-08 13:41:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:41:48,606 INFO L225 Difference]: With dead ends: 849884 [2019-09-08 13:41:48,606 INFO L226 Difference]: Without dead ends: 561498 [2019-09-08 13:41:48,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:41:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561498 states. [2019-09-08 13:42:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561498 to 472375. [2019-09-08 13:42:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472375 states. [2019-09-08 13:42:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472375 states to 472375 states and 777625 transitions. [2019-09-08 13:42:24,130 INFO L78 Accepts]: Start accepts. Automaton has 472375 states and 777625 transitions. Word has length 241 [2019-09-08 13:42:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:42:24,131 INFO L475 AbstractCegarLoop]: Abstraction has 472375 states and 777625 transitions. [2019-09-08 13:42:24,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:42:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 472375 states and 777625 transitions. [2019-09-08 13:42:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 13:42:24,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:42:24,132 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] [2019-09-08 13:42:24,133 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:42:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:42:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1685205130, now seen corresponding path program 1 times [2019-09-08 13:42:24,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:42:24,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:42:24,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:24,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:42:24,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:42:25,265 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:42:25,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:42:25,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:42:25,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:42:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:42:25,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:42:25,268 INFO L87 Difference]: Start difference. First operand 472375 states and 777625 transitions. Second operand 8 states. [2019-09-08 13:44:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:44:43,199 INFO L93 Difference]: Finished difference Result 2612960 states and 4310785 transitions. [2019-09-08 13:44:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 13:44:43,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-08 13:44:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:44:47,035 INFO L225 Difference]: With dead ends: 2612960 [2019-09-08 13:44:47,035 INFO L226 Difference]: Without dead ends: 2141251 [2019-09-08 13:44:47,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 13:44:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141251 states.