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/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:27:19,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:27:19,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:27:19,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:27:19,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:27:19,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:27:19,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:27:19,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:27:19,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:27:19,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:27:19,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:27:19,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:27:19,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:27:19,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:27:19,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:27:19,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:27:19,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:27:19,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:27:19,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:27:19,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:27:19,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:27:19,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:27:19,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:27:19,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:27:19,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:27:19,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:27:19,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:27:19,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:27:19,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:27:19,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:27:19,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:27:19,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:27:19,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:27:19,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:27:19,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:27:19,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:27:19,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:27:19,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:27:19,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:27:19,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:27:19,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:27:19,282 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 07:27:19,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:27:19,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:27:19,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:27:19,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:27:19,306 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:27:19,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:27:19,306 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:27:19,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:27:19,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:27:19,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:27:19,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:27:19,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:27:19,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:27:19,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:27:19,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:27:19,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:27:19,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:27:19,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:27:19,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:27:19,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:27:19,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:27:19,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:27:19,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:27:19,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:27:19,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:27:19,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:27:19,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:27:19,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:27:19,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:27:19,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:27:19,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:27:19,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:27:19,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:27:19,374 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:27:19,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:27:19,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6293fa8b/f6c4b19bc4404bbcad8878e7596a6177/FLAG1b59f06dd [2019-09-08 07:27:20,073 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:27:20,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:27:20,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6293fa8b/f6c4b19bc4404bbcad8878e7596a6177/FLAG1b59f06dd [2019-09-08 07:27:20,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6293fa8b/f6c4b19bc4404bbcad8878e7596a6177 [2019-09-08 07:27:20,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:27:20,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:27:20,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:27:20,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:27:20,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:27:20,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:27:20" (1/1) ... [2019-09-08 07:27:20,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9df0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:20, skipping insertion in model container [2019-09-08 07:27:20,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:27:20" (1/1) ... [2019-09-08 07:27:20,301 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:27:20,360 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:27:20,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:27:21,011 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:27:21,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:27:21,226 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:27:21,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21 WrapperNode [2019-09-08 07:27:21,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:27:21,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:27:21,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:27:21,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:27:21,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (1/1) ... [2019-09-08 07:27:21,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (1/1) ... [2019-09-08 07:27:21,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (1/1) ... [2019-09-08 07:27:21,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (1/1) ... [2019-09-08 07:27:21,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (1/1) ... [2019-09-08 07:27:21,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (1/1) ... [2019-09-08 07:27:21,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (1/1) ... [2019-09-08 07:27:21,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:27:21,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:27:21,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:27:21,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:27:21,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (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 07:27:21,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:27:21,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:27:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:27:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:27:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:27:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:27:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 07:27:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:27:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:27:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:27:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:27:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:27:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:27:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:27:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:27:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:27:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:27:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:27:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:27:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:27:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:27:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:27:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:27:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 07:27:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:27:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:27:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:27:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:27:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:27:23,728 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:27:23,728 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:27:23,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:27:23 BoogieIcfgContainer [2019-09-08 07:27:23,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:27:23,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:27:23,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:27:23,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:27:23,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:27:20" (1/3) ... [2019-09-08 07:27:23,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b07c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:27:23, skipping insertion in model container [2019-09-08 07:27:23,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:27:21" (2/3) ... [2019-09-08 07:27:23,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b07c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:27:23, skipping insertion in model container [2019-09-08 07:27:23,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:27:23" (3/3) ... [2019-09-08 07:27:23,741 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-08 07:27:23,751 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:27:23,760 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:27:23,777 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:27:23,827 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:27:23,828 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:27:23,828 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:27:23,828 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:27:23,828 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:27:23,828 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:27:23,828 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:27:23,828 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:27:23,828 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:27:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-08 07:27:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 07:27:23,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:27:23,899 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] [2019-09-08 07:27:23,902 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:27:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:27:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1909906807, now seen corresponding path program 1 times [2019-09-08 07:27:23,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:27:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:27:23,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:23,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:27:23,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:27:24,652 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 07:27:24,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:27:24,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:27:24,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:27:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:27:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:27:24,678 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 5 states. [2019-09-08 07:27:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:27:24,981 INFO L93 Difference]: Finished difference Result 929 states and 1653 transitions. [2019-09-08 07:27:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:27:24,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 07:27:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:27:25,010 INFO L225 Difference]: With dead ends: 929 [2019-09-08 07:27:25,010 INFO L226 Difference]: Without dead ends: 736 [2019-09-08 07:27:25,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:27:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-09-08 07:27:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-09-08 07:27:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-09-08 07:27:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1275 transitions. [2019-09-08 07:27:25,160 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1275 transitions. Word has length 176 [2019-09-08 07:27:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:27:25,161 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1275 transitions. [2019-09-08 07:27:25,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:27:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1275 transitions. [2019-09-08 07:27:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 07:27:25,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:27:25,179 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] [2019-09-08 07:27:25,180 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:27:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:27:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash -268525100, now seen corresponding path program 1 times [2019-09-08 07:27:25,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:27:25,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:27:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:25,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:27:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:27:25,896 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 07:27:25,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:27:25,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:27:25,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:27:25,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:27:25,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:27:25,903 INFO L87 Difference]: Start difference. First operand 736 states and 1275 transitions. Second operand 13 states. [2019-09-08 07:27:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:27:39,292 INFO L93 Difference]: Finished difference Result 3006 states and 5054 transitions. [2019-09-08 07:27:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 07:27:39,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-09-08 07:27:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:27:39,316 INFO L225 Difference]: With dead ends: 3006 [2019-09-08 07:27:39,316 INFO L226 Difference]: Without dead ends: 2822 [2019-09-08 07:27:39,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 07:27:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2019-09-08 07:27:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2030. [2019-09-08 07:27:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-09-08 07:27:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 3422 transitions. [2019-09-08 07:27:39,469 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 3422 transitions. Word has length 235 [2019-09-08 07:27:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:27:39,470 INFO L475 AbstractCegarLoop]: Abstraction has 2030 states and 3422 transitions. [2019-09-08 07:27:39,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:27:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 3422 transitions. [2019-09-08 07:27:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 07:27:39,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:27:39,479 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] [2019-09-08 07:27:39,479 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:27:39,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:27:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash -699503355, now seen corresponding path program 1 times [2019-09-08 07:27:39,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:27:39,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:27:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:39,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:27:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:27:39,943 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 07:27:39,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:27:39,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:27:39,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:27:39,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:27:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:27:39,947 INFO L87 Difference]: Start difference. First operand 2030 states and 3422 transitions. Second operand 6 states. [2019-09-08 07:27:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:27:43,859 INFO L93 Difference]: Finished difference Result 5014 states and 8363 transitions. [2019-09-08 07:27:43,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:27:43,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-08 07:27:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:27:43,891 INFO L225 Difference]: With dead ends: 5014 [2019-09-08 07:27:43,892 INFO L226 Difference]: Without dead ends: 3536 [2019-09-08 07:27:43,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:27:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2019-09-08 07:27:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3345. [2019-09-08 07:27:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3345 states. [2019-09-08 07:27:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 5590 transitions. [2019-09-08 07:27:44,064 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 5590 transitions. Word has length 236 [2019-09-08 07:27:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:27:44,065 INFO L475 AbstractCegarLoop]: Abstraction has 3345 states and 5590 transitions. [2019-09-08 07:27:44,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:27:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 5590 transitions. [2019-09-08 07:27:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 07:27:44,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:27:44,072 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 07:27:44,073 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:27:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:27:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1226612309, now seen corresponding path program 1 times [2019-09-08 07:27:44,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:27:44,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:27:44,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:44,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:27:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:27:44,419 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 07:27:44,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:27:44,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:27:44,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:27:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:27:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:27:44,421 INFO L87 Difference]: Start difference. First operand 3345 states and 5590 transitions. Second operand 6 states. [2019-09-08 07:27:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:27:48,865 INFO L93 Difference]: Finished difference Result 9374 states and 15534 transitions. [2019-09-08 07:27:48,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:27:48,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-08 07:27:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:27:48,900 INFO L225 Difference]: With dead ends: 9374 [2019-09-08 07:27:48,901 INFO L226 Difference]: Without dead ends: 6581 [2019-09-08 07:27:48,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:27:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-09-08 07:27:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 5617. [2019-09-08 07:27:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5617 states. [2019-09-08 07:27:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5617 states to 5617 states and 9313 transitions. [2019-09-08 07:27:49,144 INFO L78 Accepts]: Start accepts. Automaton has 5617 states and 9313 transitions. Word has length 237 [2019-09-08 07:27:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:27:49,145 INFO L475 AbstractCegarLoop]: Abstraction has 5617 states and 9313 transitions. [2019-09-08 07:27:49,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:27:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5617 states and 9313 transitions. [2019-09-08 07:27:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 07:27:49,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:27:49,153 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 07:27:49,153 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:27:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:27:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash -438805636, now seen corresponding path program 1 times [2019-09-08 07:27:49,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:27:49,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:27:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:49,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:27:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:27:49,444 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 07:27:49,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:27:49,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:27:49,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:27:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:27:49,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:27:49,447 INFO L87 Difference]: Start difference. First operand 5617 states and 9313 transitions. Second operand 6 states. [2019-09-08 07:27:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:27:53,090 INFO L93 Difference]: Finished difference Result 21935 states and 36146 transitions. [2019-09-08 07:27:53,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:27:53,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-09-08 07:27:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:27:53,181 INFO L225 Difference]: With dead ends: 21935 [2019-09-08 07:27:53,181 INFO L226 Difference]: Without dead ends: 16870 [2019-09-08 07:27:53,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:27:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16870 states. [2019-09-08 07:27:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16870 to 13926. [2019-09-08 07:27:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13926 states. [2019-09-08 07:27:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13926 states to 13926 states and 22887 transitions. [2019-09-08 07:27:53,798 INFO L78 Accepts]: Start accepts. Automaton has 13926 states and 22887 transitions. Word has length 238 [2019-09-08 07:27:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:27:53,799 INFO L475 AbstractCegarLoop]: Abstraction has 13926 states and 22887 transitions. [2019-09-08 07:27:53,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:27:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13926 states and 22887 transitions. [2019-09-08 07:27:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 07:27:53,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:27:53,809 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 07:27:53,809 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:27:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:27:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1838287486, now seen corresponding path program 1 times [2019-09-08 07:27:53,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:27:53,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:27:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:53,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:27:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:27:54,029 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 07:27:54,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:27:54,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:27:54,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:27:54,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:27:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:27:54,031 INFO L87 Difference]: Start difference. First operand 13926 states and 22887 transitions. Second operand 6 states. [2019-09-08 07:27:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:27:59,706 INFO L93 Difference]: Finished difference Result 80238 states and 131647 transitions. [2019-09-08 07:27:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:27:59,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-08 07:27:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:27:59,939 INFO L225 Difference]: With dead ends: 80238 [2019-09-08 07:27:59,940 INFO L226 Difference]: Without dead ends: 66864 [2019-09-08 07:27:59,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:28:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66864 states. [2019-09-08 07:28:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66864 to 66712. [2019-09-08 07:28:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66712 states. [2019-09-08 07:28:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66712 states to 66712 states and 109154 transitions. [2019-09-08 07:28:01,931 INFO L78 Accepts]: Start accepts. Automaton has 66712 states and 109154 transitions. Word has length 239 [2019-09-08 07:28:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:28:01,932 INFO L475 AbstractCegarLoop]: Abstraction has 66712 states and 109154 transitions. [2019-09-08 07:28:01,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:28:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 66712 states and 109154 transitions. [2019-09-08 07:28:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:28:01,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:28:01,947 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 07:28:01,947 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:28:01,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:28:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1970730483, now seen corresponding path program 1 times [2019-09-08 07:28:01,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:28:01,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:28:01,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:28:01,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:28:01,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:28:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:28:02,200 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 07:28:02,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:28:02,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:28:02,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:28:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:28:02,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:28:02,202 INFO L87 Difference]: Start difference. First operand 66712 states and 109154 transitions. Second operand 6 states. [2019-09-08 07:28:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:28:11,423 INFO L93 Difference]: Finished difference Result 302620 states and 494792 transitions. [2019-09-08 07:28:11,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:28:11,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 07:28:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:28:12,176 INFO L225 Difference]: With dead ends: 302620 [2019-09-08 07:28:12,177 INFO L226 Difference]: Without dead ends: 236460 [2019-09-08 07:28:12,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:28:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236460 states. [2019-09-08 07:28:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236460 to 169720. [2019-09-08 07:28:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169720 states. [2019-09-08 07:28:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169720 states to 169720 states and 276953 transitions. [2019-09-08 07:28:20,371 INFO L78 Accepts]: Start accepts. Automaton has 169720 states and 276953 transitions. Word has length 240 [2019-09-08 07:28:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:28:20,371 INFO L475 AbstractCegarLoop]: Abstraction has 169720 states and 276953 transitions. [2019-09-08 07:28:20,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:28:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 169720 states and 276953 transitions. [2019-09-08 07:28:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:28:20,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:28:20,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:28:20,382 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:28:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:28:20,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1025117066, now seen corresponding path program 1 times [2019-09-08 07:28:20,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:28:20,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:28:20,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:28:20,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:28:20,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:28:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:28:20,739 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 07:28:20,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:28:20,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:28:20,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:28:20,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:28:20,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:28:20,741 INFO L87 Difference]: Start difference. First operand 169720 states and 276953 transitions. Second operand 13 states. [2019-09-08 07:28:31,053 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-09-08 07:28:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:28:40,998 INFO L93 Difference]: Finished difference Result 290738 states and 475117 transitions. [2019-09-08 07:28:40,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 07:28:40,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-08 07:28:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:28:41,644 INFO L225 Difference]: With dead ends: 290738 [2019-09-08 07:28:41,644 INFO L226 Difference]: Without dead ends: 256896 [2019-09-08 07:28:41,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 07:28:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256896 states. [2019-09-08 07:28:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256896 to 233854. [2019-09-08 07:28:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233854 states. [2019-09-08 07:28:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233854 states to 233854 states and 382326 transitions. [2019-09-08 07:28:51,232 INFO L78 Accepts]: Start accepts. Automaton has 233854 states and 382326 transitions. Word has length 242 [2019-09-08 07:28:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:28:51,233 INFO L475 AbstractCegarLoop]: Abstraction has 233854 states and 382326 transitions. [2019-09-08 07:28:51,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:28:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 233854 states and 382326 transitions. [2019-09-08 07:28:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:28:51,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:28:51,244 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 07:28:51,244 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:28:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:28:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1376652368, now seen corresponding path program 1 times [2019-09-08 07:28:51,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:28:51,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:28:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:28:51,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:28:51,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:28:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:28:51,595 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 07:28:51,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:28:51,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:28:51,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:28:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:28:51,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:28:51,598 INFO L87 Difference]: Start difference. First operand 233854 states and 382326 transitions. Second operand 13 states. [2019-09-08 07:29:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:29:13,353 INFO L93 Difference]: Finished difference Result 374165 states and 613906 transitions. [2019-09-08 07:29:13,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 07:29:13,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-08 07:29:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:29:14,025 INFO L225 Difference]: With dead ends: 374165 [2019-09-08 07:29:14,025 INFO L226 Difference]: Without dead ends: 307446 [2019-09-08 07:29:14,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 07:29:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307446 states. [2019-09-08 07:29:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307446 to 265306. [2019-09-08 07:29:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265306 states. [2019-09-08 07:29:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265306 states to 265306 states and 434221 transitions. [2019-09-08 07:29:23,551 INFO L78 Accepts]: Start accepts. Automaton has 265306 states and 434221 transitions. Word has length 242 [2019-09-08 07:29:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:29:23,552 INFO L475 AbstractCegarLoop]: Abstraction has 265306 states and 434221 transitions. [2019-09-08 07:29:23,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:29:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 265306 states and 434221 transitions. [2019-09-08 07:29:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:29:23,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:29:23,564 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 07:29:23,564 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:29:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:29:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash -694496930, now seen corresponding path program 1 times [2019-09-08 07:29:23,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:29:23,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:29:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:29:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:29:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:29:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:29:23,849 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 07:29:23,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:29:23,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:29:23,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:29:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:29:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:29:23,851 INFO L87 Difference]: Start difference. First operand 265306 states and 434221 transitions. Second operand 13 states. [2019-09-08 07:29:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:29:48,297 INFO L93 Difference]: Finished difference Result 427123 states and 700435 transitions. [2019-09-08 07:29:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 07:29:48,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-08 07:29:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:29:49,015 INFO L225 Difference]: With dead ends: 427123 [2019-09-08 07:29:49,016 INFO L226 Difference]: Without dead ends: 332291 [2019-09-08 07:29:49,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 07:29:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332291 states. [2019-09-08 07:30:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332291 to 287769. [2019-09-08 07:30:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287769 states. [2019-09-08 07:30:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287769 states to 287769 states and 471387 transitions. [2019-09-08 07:30:01,803 INFO L78 Accepts]: Start accepts. Automaton has 287769 states and 471387 transitions. Word has length 242 [2019-09-08 07:30:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:30:01,804 INFO L475 AbstractCegarLoop]: Abstraction has 287769 states and 471387 transitions. [2019-09-08 07:30:01,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:30:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 287769 states and 471387 transitions. [2019-09-08 07:30:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 07:30:01,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:30:01,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:30:01,815 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:30:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:30:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2014276523, now seen corresponding path program 1 times [2019-09-08 07:30:01,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:30:01,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:30:01,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:01,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:30:01,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:30:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:30:01,998 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 07:30:01,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:30:01,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:30:01,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:30:01,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:30:02,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:30:02,001 INFO L87 Difference]: Start difference. First operand 287769 states and 471387 transitions. Second operand 4 states. [2019-09-08 07:30:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:30:18,915 INFO L93 Difference]: Finished difference Result 1045546 states and 1722304 transitions. [2019-09-08 07:30:18,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:30:18,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-08 07:30:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:30:21,512 INFO L225 Difference]: With dead ends: 1045546 [2019-09-08 07:30:21,512 INFO L226 Difference]: Without dead ends: 758329 [2019-09-08 07:30:28,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:30:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758329 states. [2019-09-08 07:31:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758329 to 754041. [2019-09-08 07:31:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754041 states. [2019-09-08 07:31:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754041 states to 754041 states and 1230443 transitions. [2019-09-08 07:31:05,976 INFO L78 Accepts]: Start accepts. Automaton has 754041 states and 1230443 transitions. Word has length 242 [2019-09-08 07:31:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:31:05,977 INFO L475 AbstractCegarLoop]: Abstraction has 754041 states and 1230443 transitions. [2019-09-08 07:31:05,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:31:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 754041 states and 1230443 transitions. [2019-09-08 07:31:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 07:31:05,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:31:05,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:31:05,984 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:31:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:31:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1607107123, now seen corresponding path program 1 times [2019-09-08 07:31:05,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:31:05,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:31:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:05,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:31:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:31:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:31:06,318 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 07:31:06,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:31:06,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 07:31:06,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:31:06,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:31:06,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:31:06,320 INFO L87 Difference]: Start difference. First operand 754041 states and 1230443 transitions. Second operand 14 states. [2019-09-08 07:32:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:32:33,804 INFO L93 Difference]: Finished difference Result 2364708 states and 3962942 transitions. [2019-09-08 07:32:33,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 07:32:33,805 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 243 [2019-09-08 07:32:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:32:55,106 INFO L225 Difference]: With dead ends: 2364708 [2019-09-08 07:32:55,107 INFO L226 Difference]: Without dead ends: 1878891 [2019-09-08 07:32:55,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1420, Invalid=5720, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 07:32:57,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878891 states.