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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:09:15,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:09:15,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:09:15,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:09:15,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:09:15,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:09:15,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:09:15,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:09:15,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:09:15,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:09:15,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:09:15,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:09:15,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:09:15,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:09:15,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:09:15,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:09:15,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:09:15,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:09:15,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:09:15,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:09:15,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:09:15,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:09:15,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:09:15,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:09:15,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:09:15,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:09:15,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:09:15,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:09:15,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:09:15,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:09:15,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:09:15,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:09:15,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:09:15,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:09:15,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:09:15,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:09:15,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:09:15,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:09:15,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:09:15,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:09:15,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:09:15,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:09:15,342 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:09:15,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:09:15,343 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:09:15,343 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:09:15,344 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:09:15,344 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:09:15,344 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:09:15,344 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:09:15,345 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:09:15,345 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:09:15,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:09:15,346 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:09:15,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:09:15,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:09:15,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:09:15,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:09:15,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:09:15,347 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:09:15,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:09:15,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:09:15,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:09:15,348 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:09:15,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:09:15,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:09:15,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:09:15,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:09:15,349 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:09:15,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:09:15,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:09:15,350 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:09:15,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:09:15,393 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:09:15,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:09:15,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:09:15,398 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:09:15,399 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:09:15,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059de6e9d/63f778dfaf9d4111bc8ca6968e51ee80/FLAG99d894600 [2019-09-10 07:09:16,038 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:09:16,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:09:16,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059de6e9d/63f778dfaf9d4111bc8ca6968e51ee80/FLAG99d894600 [2019-09-10 07:09:16,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059de6e9d/63f778dfaf9d4111bc8ca6968e51ee80 [2019-09-10 07:09:16,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:09:16,337 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:09:16,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:09:16,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:09:16,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:09:16,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:09:16" (1/1) ... [2019-09-10 07:09:16,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b60ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:16, skipping insertion in model container [2019-09-10 07:09:16,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:09:16" (1/1) ... [2019-09-10 07:09:16,354 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:09:16,433 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:09:16,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:09:16,977 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:09:17,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:09:17,457 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:09:17,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17 WrapperNode [2019-09-10 07:09:17,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:09:17,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:09:17,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:09:17,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:09:17,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (1/1) ... [2019-09-10 07:09:17,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (1/1) ... [2019-09-10 07:09:17,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (1/1) ... [2019-09-10 07:09:17,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (1/1) ... [2019-09-10 07:09:17,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (1/1) ... [2019-09-10 07:09:17,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (1/1) ... [2019-09-10 07:09:17,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (1/1) ... [2019-09-10 07:09:17,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:09:17,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:09:17,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:09:17,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:09:17,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (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-10 07:09:17,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:09:17,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:09:17,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:09:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:09:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:09:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:09:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:09:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:09:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:09:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:09:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:09:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:09:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:09:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:09:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:09:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:09:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:09:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:09:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:09:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:09:19,333 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:09:19,334 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:09:19,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:09:19 BoogieIcfgContainer [2019-09-10 07:09:19,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:09:19,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:09:19,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:09:19,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:09:19,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:09:16" (1/3) ... [2019-09-10 07:09:19,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b8641f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:09:19, skipping insertion in model container [2019-09-10 07:09:19,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:17" (2/3) ... [2019-09-10 07:09:19,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b8641f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:09:19, skipping insertion in model container [2019-09-10 07:09:19,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:09:19" (3/3) ... [2019-09-10 07:09:19,349 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-10 07:09:19,359 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:09:19,388 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:09:19,410 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:09:19,446 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:09:19,446 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:09:19,446 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:09:19,447 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:09:19,447 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:09:19,447 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:09:19,447 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:09:19,447 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:09:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states. [2019-09-10 07:09:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:09:19,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:19,503 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] [2019-09-10 07:09:19,506 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash -986324288, now seen corresponding path program 1 times [2019-09-10 07:09:19,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:19,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:19,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:19,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:19,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:19,995 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-10 07:09:19,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:19,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:09:19,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:20,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:09:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:09:20,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:09:20,025 INFO L87 Difference]: Start difference. First operand 411 states. Second operand 4 states. [2019-09-10 07:09:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:20,215 INFO L93 Difference]: Finished difference Result 417 states and 675 transitions. [2019-09-10 07:09:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:09:20,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 07:09:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:20,235 INFO L225 Difference]: With dead ends: 417 [2019-09-10 07:09:20,236 INFO L226 Difference]: Without dead ends: 407 [2019-09-10 07:09:20,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:09:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-10 07:09:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-09-10 07:09:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-10 07:09:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 627 transitions. [2019-09-10 07:09:20,312 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 627 transitions. Word has length 107 [2019-09-10 07:09:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:20,313 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 627 transitions. [2019-09-10 07:09:20,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:09:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 627 transitions. [2019-09-10 07:09:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 07:09:20,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:20,321 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] [2019-09-10 07:09:20,322 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:20,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:20,322 INFO L82 PathProgramCache]: Analyzing trace with hash -267942580, now seen corresponding path program 1 times [2019-09-10 07:09:20,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:20,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:20,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:20,571 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-10 07:09:20,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:20,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:20,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:20,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:20,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:20,580 INFO L87 Difference]: Start difference. First operand 407 states and 627 transitions. Second operand 3 states. [2019-09-10 07:09:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:20,650 INFO L93 Difference]: Finished difference Result 643 states and 999 transitions. [2019-09-10 07:09:20,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:20,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 07:09:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:20,657 INFO L225 Difference]: With dead ends: 643 [2019-09-10 07:09:20,657 INFO L226 Difference]: Without dead ends: 643 [2019-09-10 07:09:20,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-10 07:09:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2019-09-10 07:09:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 07:09:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 998 transitions. [2019-09-10 07:09:20,712 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 998 transitions. Word has length 138 [2019-09-10 07:09:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:20,712 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 998 transitions. [2019-09-10 07:09:20,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 998 transitions. [2019-09-10 07:09:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 07:09:20,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:20,726 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] [2019-09-10 07:09:20,726 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1029982986, now seen corresponding path program 1 times [2019-09-10 07:09:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:20,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:20,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:20,875 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-10 07:09:20,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:20,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:20,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:20,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:20,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:20,879 INFO L87 Difference]: Start difference. First operand 641 states and 998 transitions. Second operand 3 states. [2019-09-10 07:09:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:20,950 INFO L93 Difference]: Finished difference Result 1038 states and 1623 transitions. [2019-09-10 07:09:20,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:20,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 07:09:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:20,972 INFO L225 Difference]: With dead ends: 1038 [2019-09-10 07:09:20,972 INFO L226 Difference]: Without dead ends: 1038 [2019-09-10 07:09:20,973 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-10 07:09:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2019-09-10 07:09:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1036. [2019-09-10 07:09:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-10 07:09:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1622 transitions. [2019-09-10 07:09:21,014 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1622 transitions. Word has length 138 [2019-09-10 07:09:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:21,017 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1622 transitions. [2019-09-10 07:09:21,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1622 transitions. [2019-09-10 07:09:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:09:21,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:21,023 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] [2019-09-10 07:09:21,024 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash 52580276, now seen corresponding path program 1 times [2019-09-10 07:09:21,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:21,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:21,180 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-10 07:09:21,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:21,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:21,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:21,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:21,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:21,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:21,183 INFO L87 Difference]: Start difference. First operand 1036 states and 1622 transitions. Second operand 3 states. [2019-09-10 07:09:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:21,275 INFO L93 Difference]: Finished difference Result 1697 states and 2657 transitions. [2019-09-10 07:09:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:21,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 07:09:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:21,286 INFO L225 Difference]: With dead ends: 1697 [2019-09-10 07:09:21,287 INFO L226 Difference]: Without dead ends: 1697 [2019-09-10 07:09:21,287 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-10 07:09:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-09-10 07:09:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1695. [2019-09-10 07:09:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-09-10 07:09:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2656 transitions. [2019-09-10 07:09:21,337 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2656 transitions. Word has length 140 [2019-09-10 07:09:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:21,339 INFO L475 AbstractCegarLoop]: Abstraction has 1695 states and 2656 transitions. [2019-09-10 07:09:21,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2656 transitions. [2019-09-10 07:09:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 07:09:21,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:21,346 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] [2019-09-10 07:09:21,347 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash 749398092, now seen corresponding path program 1 times [2019-09-10 07:09:21,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:21,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:21,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:21,485 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-10 07:09:21,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:21,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:21,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:21,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:21,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:21,487 INFO L87 Difference]: Start difference. First operand 1695 states and 2656 transitions. Second operand 3 states. [2019-09-10 07:09:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:21,558 INFO L93 Difference]: Finished difference Result 2748 states and 4287 transitions. [2019-09-10 07:09:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:21,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-10 07:09:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:21,574 INFO L225 Difference]: With dead ends: 2748 [2019-09-10 07:09:21,575 INFO L226 Difference]: Without dead ends: 2748 [2019-09-10 07:09:21,575 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-10 07:09:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2019-09-10 07:09:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2746. [2019-09-10 07:09:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2746 states. [2019-09-10 07:09:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 4286 transitions. [2019-09-10 07:09:21,660 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 4286 transitions. Word has length 142 [2019-09-10 07:09:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:21,661 INFO L475 AbstractCegarLoop]: Abstraction has 2746 states and 4286 transitions. [2019-09-10 07:09:21,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 4286 transitions. [2019-09-10 07:09:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 07:09:21,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:21,670 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] [2019-09-10 07:09:21,670 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:21,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash 215854232, now seen corresponding path program 1 times [2019-09-10 07:09:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:21,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:21,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:21,760 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-10 07:09:21,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:21,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:21,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:21,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:21,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:21,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:21,763 INFO L87 Difference]: Start difference. First operand 2746 states and 4286 transitions. Second operand 3 states. [2019-09-10 07:09:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:21,856 INFO L93 Difference]: Finished difference Result 4311 states and 6661 transitions. [2019-09-10 07:09:21,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:21,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 07:09:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:21,879 INFO L225 Difference]: With dead ends: 4311 [2019-09-10 07:09:21,879 INFO L226 Difference]: Without dead ends: 4311 [2019-09-10 07:09:21,880 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-10 07:09:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2019-09-10 07:09:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 4309. [2019-09-10 07:09:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4309 states. [2019-09-10 07:09:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 4309 states and 6660 transitions. [2019-09-10 07:09:22,006 INFO L78 Accepts]: Start accepts. Automaton has 4309 states and 6660 transitions. Word has length 144 [2019-09-10 07:09:22,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:22,007 INFO L475 AbstractCegarLoop]: Abstraction has 4309 states and 6660 transitions. [2019-09-10 07:09:22,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 4309 states and 6660 transitions. [2019-09-10 07:09:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 07:09:22,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:22,020 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] [2019-09-10 07:09:22,020 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 317610490, now seen corresponding path program 1 times [2019-09-10 07:09:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:22,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:22,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:22,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:22,370 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-10 07:09:22,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:22,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:22,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:22,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:22,372 INFO L87 Difference]: Start difference. First operand 4309 states and 6660 transitions. Second operand 7 states. [2019-09-10 07:09:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:23,257 INFO L93 Difference]: Finished difference Result 18040 states and 27405 transitions. [2019-09-10 07:09:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:23,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 07:09:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:23,355 INFO L225 Difference]: With dead ends: 18040 [2019-09-10 07:09:23,355 INFO L226 Difference]: Without dead ends: 18040 [2019-09-10 07:09:23,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18040 states. [2019-09-10 07:09:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18040 to 18032. [2019-09-10 07:09:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18032 states. [2019-09-10 07:09:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18032 states to 18032 states and 27401 transitions. [2019-09-10 07:09:23,723 INFO L78 Accepts]: Start accepts. Automaton has 18032 states and 27401 transitions. Word has length 146 [2019-09-10 07:09:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:23,724 INFO L475 AbstractCegarLoop]: Abstraction has 18032 states and 27401 transitions. [2019-09-10 07:09:23,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18032 states and 27401 transitions. [2019-09-10 07:09:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 07:09:23,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:23,779 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] [2019-09-10 07:09:23,779 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:23,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1963375210, now seen corresponding path program 1 times [2019-09-10 07:09:23,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:23,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:23,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:23,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:23,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:24,028 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-10 07:09:24,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:24,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:24,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:24,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:24,030 INFO L87 Difference]: Start difference. First operand 18032 states and 27401 transitions. Second operand 3 states. [2019-09-10 07:09:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:24,192 INFO L93 Difference]: Finished difference Result 29852 states and 44959 transitions. [2019-09-10 07:09:24,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:24,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 07:09:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:24,268 INFO L225 Difference]: With dead ends: 29852 [2019-09-10 07:09:24,268 INFO L226 Difference]: Without dead ends: 29852 [2019-09-10 07:09:24,269 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-10 07:09:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29852 states. [2019-09-10 07:09:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29852 to 29850. [2019-09-10 07:09:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29850 states. [2019-09-10 07:09:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29850 states to 29850 states and 44958 transitions. [2019-09-10 07:09:25,609 INFO L78 Accepts]: Start accepts. Automaton has 29850 states and 44958 transitions. Word has length 149 [2019-09-10 07:09:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:25,610 INFO L475 AbstractCegarLoop]: Abstraction has 29850 states and 44958 transitions. [2019-09-10 07:09:25,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 29850 states and 44958 transitions. [2019-09-10 07:09:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 07:09:25,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:25,686 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] [2019-09-10 07:09:25,687 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:25,687 INFO L82 PathProgramCache]: Analyzing trace with hash 745206864, now seen corresponding path program 1 times [2019-09-10 07:09:25,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:25,809 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-10 07:09:25,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:25,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:25,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:25,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:25,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:25,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:25,811 INFO L87 Difference]: Start difference. First operand 29850 states and 44958 transitions. Second operand 3 states. [2019-09-10 07:09:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:25,973 INFO L93 Difference]: Finished difference Result 36600 states and 55139 transitions. [2019-09-10 07:09:25,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:25,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 07:09:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:26,050 INFO L225 Difference]: With dead ends: 36600 [2019-09-10 07:09:26,051 INFO L226 Difference]: Without dead ends: 36600 [2019-09-10 07:09:26,052 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-10 07:09:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36600 states. [2019-09-10 07:09:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36600 to 36598. [2019-09-10 07:09:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36598 states. [2019-09-10 07:09:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36598 states to 36598 states and 55138 transitions. [2019-09-10 07:09:26,722 INFO L78 Accepts]: Start accepts. Automaton has 36598 states and 55138 transitions. Word has length 149 [2019-09-10 07:09:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:26,722 INFO L475 AbstractCegarLoop]: Abstraction has 36598 states and 55138 transitions. [2019-09-10 07:09:26,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 36598 states and 55138 transitions. [2019-09-10 07:09:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 07:09:26,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:26,797 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] [2019-09-10 07:09:26,797 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:26,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2085871384, now seen corresponding path program 1 times [2019-09-10 07:09:26,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:26,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:26,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:26,927 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-10 07:09:26,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:26,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:26,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:26,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:26,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:26,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:26,930 INFO L87 Difference]: Start difference. First operand 36598 states and 55138 transitions. Second operand 3 states. [2019-09-10 07:09:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:27,168 INFO L93 Difference]: Finished difference Result 61480 states and 91593 transitions. [2019-09-10 07:09:27,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:27,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 07:09:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:28,173 INFO L225 Difference]: With dead ends: 61480 [2019-09-10 07:09:28,175 INFO L226 Difference]: Without dead ends: 61480 [2019-09-10 07:09:28,175 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-10 07:09:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61480 states. [2019-09-10 07:09:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61480 to 61478. [2019-09-10 07:09:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61478 states. [2019-09-10 07:09:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61478 states to 61478 states and 91592 transitions. [2019-09-10 07:09:28,970 INFO L78 Accepts]: Start accepts. Automaton has 61478 states and 91592 transitions. Word has length 150 [2019-09-10 07:09:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:28,970 INFO L475 AbstractCegarLoop]: Abstraction has 61478 states and 91592 transitions. [2019-09-10 07:09:28,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 61478 states and 91592 transitions. [2019-09-10 07:09:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 07:09:29,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:29,034 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] [2019-09-10 07:09:29,034 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 54971742, now seen corresponding path program 1 times [2019-09-10 07:09:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:29,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:29,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:29,248 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-10 07:09:29,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:29,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:29,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:29,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:29,250 INFO L87 Difference]: Start difference. First operand 61478 states and 91592 transitions. Second operand 7 states. [2019-09-10 07:09:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:30,487 INFO L93 Difference]: Finished difference Result 199767 states and 292097 transitions. [2019-09-10 07:09:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:30,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-09-10 07:09:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:30,742 INFO L225 Difference]: With dead ends: 199767 [2019-09-10 07:09:30,742 INFO L226 Difference]: Without dead ends: 199767 [2019-09-10 07:09:30,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:09:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199767 states. [2019-09-10 07:09:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199767 to 117773. [2019-09-10 07:09:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117773 states. [2019-09-10 07:09:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117773 states to 117773 states and 171651 transitions. [2019-09-10 07:09:34,849 INFO L78 Accepts]: Start accepts. Automaton has 117773 states and 171651 transitions. Word has length 150 [2019-09-10 07:09:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:34,850 INFO L475 AbstractCegarLoop]: Abstraction has 117773 states and 171651 transitions. [2019-09-10 07:09:34,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 117773 states and 171651 transitions. [2019-09-10 07:09:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:09:34,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:34,961 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] [2019-09-10 07:09:34,962 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 231406676, now seen corresponding path program 1 times [2019-09-10 07:09:34,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:34,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:34,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:35,130 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-10 07:09:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:35,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:09:35,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:35,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:09:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:09:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:09:35,132 INFO L87 Difference]: Start difference. First operand 117773 states and 171651 transitions. Second operand 6 states. [2019-09-10 07:09:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:37,949 INFO L93 Difference]: Finished difference Result 170509 states and 246483 transitions. [2019-09-10 07:09:37,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:37,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-09-10 07:09:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:38,169 INFO L225 Difference]: With dead ends: 170509 [2019-09-10 07:09:38,169 INFO L226 Difference]: Without dead ends: 170509 [2019-09-10 07:09:38,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:09:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170509 states. [2019-09-10 07:09:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170509 to 120077. [2019-09-10 07:09:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120077 states. [2019-09-10 07:09:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120077 states to 120077 states and 173955 transitions. [2019-09-10 07:09:39,965 INFO L78 Accepts]: Start accepts. Automaton has 120077 states and 173955 transitions. Word has length 154 [2019-09-10 07:09:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:39,965 INFO L475 AbstractCegarLoop]: Abstraction has 120077 states and 173955 transitions. [2019-09-10 07:09:39,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:09:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 120077 states and 173955 transitions. [2019-09-10 07:09:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:09:40,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:40,091 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] [2019-09-10 07:09:40,091 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2041688229, now seen corresponding path program 1 times [2019-09-10 07:09:40,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:40,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:40,588 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-09-10 07:09:40,637 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-10 07:09:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:40,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:40,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:40,639 INFO L87 Difference]: Start difference. First operand 120077 states and 173955 transitions. Second operand 7 states. [2019-09-10 07:09:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:42,939 INFO L93 Difference]: Finished difference Result 207015 states and 298754 transitions. [2019-09-10 07:09:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:09:42,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 154 [2019-09-10 07:09:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:43,204 INFO L225 Difference]: With dead ends: 207015 [2019-09-10 07:09:43,205 INFO L226 Difference]: Without dead ends: 207015 [2019-09-10 07:09:43,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:09:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207015 states. [2019-09-10 07:09:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207015 to 118183. [2019-09-10 07:09:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118183 states. [2019-09-10 07:09:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118183 states to 118183 states and 171077 transitions. [2019-09-10 07:09:48,520 INFO L78 Accepts]: Start accepts. Automaton has 118183 states and 171077 transitions. Word has length 154 [2019-09-10 07:09:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:48,521 INFO L475 AbstractCegarLoop]: Abstraction has 118183 states and 171077 transitions. [2019-09-10 07:09:48,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 118183 states and 171077 transitions. [2019-09-10 07:09:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:09:48,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:48,637 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] [2019-09-10 07:09:48,637 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1863138123, now seen corresponding path program 1 times [2019-09-10 07:09:48,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:48,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:48,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:48,737 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-10 07:09:48,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:48,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:48,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:48,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:48,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:48,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:48,740 INFO L87 Difference]: Start difference. First operand 118183 states and 171077 transitions. Second operand 3 states. [2019-09-10 07:09:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:49,202 INFO L93 Difference]: Finished difference Result 176202 states and 250804 transitions. [2019-09-10 07:09:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:49,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-10 07:09:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:49,393 INFO L225 Difference]: With dead ends: 176202 [2019-09-10 07:09:49,393 INFO L226 Difference]: Without dead ends: 176202 [2019-09-10 07:09:49,394 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-10 07:09:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176202 states. [2019-09-10 07:09:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176202 to 169602. [2019-09-10 07:09:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169602 states. [2019-09-10 07:09:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169602 states to 169602 states and 242171 transitions. [2019-09-10 07:09:55,185 INFO L78 Accepts]: Start accepts. Automaton has 169602 states and 242171 transitions. Word has length 154 [2019-09-10 07:09:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:55,186 INFO L475 AbstractCegarLoop]: Abstraction has 169602 states and 242171 transitions. [2019-09-10 07:09:55,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 169602 states and 242171 transitions. [2019-09-10 07:09:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:09:55,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:55,334 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] [2019-09-10 07:09:55,335 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:55,335 INFO L82 PathProgramCache]: Analyzing trace with hash 385954444, now seen corresponding path program 1 times [2019-09-10 07:09:55,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:55,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:55,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:55,417 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-10 07:09:55,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:55,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:55,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:55,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:55,418 INFO L87 Difference]: Start difference. First operand 169602 states and 242171 transitions. Second operand 3 states. [2019-09-10 07:09:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:56,023 INFO L93 Difference]: Finished difference Result 229591 states and 322490 transitions. [2019-09-10 07:09:56,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:56,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-10 07:09:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:56,471 INFO L225 Difference]: With dead ends: 229591 [2019-09-10 07:09:56,472 INFO L226 Difference]: Without dead ends: 217611 [2019-09-10 07:09:56,474 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-10 07:09:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217611 states. [2019-09-10 07:10:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217611 to 213566. [2019-09-10 07:10:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213566 states. [2019-09-10 07:10:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213566 states to 213566 states and 300808 transitions. [2019-09-10 07:10:02,881 INFO L78 Accepts]: Start accepts. Automaton has 213566 states and 300808 transitions. Word has length 154 [2019-09-10 07:10:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:02,881 INFO L475 AbstractCegarLoop]: Abstraction has 213566 states and 300808 transitions. [2019-09-10 07:10:02,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:10:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 213566 states and 300808 transitions. [2019-09-10 07:10:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:10:03,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:03,093 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] [2019-09-10 07:10:03,093 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1676859252, now seen corresponding path program 1 times [2019-09-10 07:10:03,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:03,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:03,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:03,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:03,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:03,261 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-10 07:10:03,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:03,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:10:03,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:03,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:10:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:10:03,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:10:03,265 INFO L87 Difference]: Start difference. First operand 213566 states and 300808 transitions. Second operand 5 states. [2019-09-10 07:10:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:04,883 INFO L93 Difference]: Finished difference Result 303055 states and 422554 transitions. [2019-09-10 07:10:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:10:04,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-09-10 07:10:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:05,407 INFO L225 Difference]: With dead ends: 303055 [2019-09-10 07:10:05,407 INFO L226 Difference]: Without dead ends: 303055 [2019-09-10 07:10:05,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303055 states. [2019-09-10 07:10:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303055 to 302631. [2019-09-10 07:10:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302631 states. [2019-09-10 07:10:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302631 states to 302631 states and 422124 transitions. [2019-09-10 07:10:13,815 INFO L78 Accepts]: Start accepts. Automaton has 302631 states and 422124 transitions. Word has length 154 [2019-09-10 07:10:13,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:13,816 INFO L475 AbstractCegarLoop]: Abstraction has 302631 states and 422124 transitions. [2019-09-10 07:10:13,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:10:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 302631 states and 422124 transitions. [2019-09-10 07:10:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:10:14,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:14,137 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] [2019-09-10 07:10:14,137 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1589890942, now seen corresponding path program 1 times [2019-09-10 07:10:14,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:14,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:14,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:14,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:14,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:14,273 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-10 07:10:14,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:14,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:14,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:14,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:14,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:14,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:14,275 INFO L87 Difference]: Start difference. First operand 302631 states and 422124 transitions. Second operand 7 states. [2019-09-10 07:10:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:19,433 INFO L93 Difference]: Finished difference Result 862730 states and 1197084 transitions. [2019-09-10 07:10:19,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:19,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 154 [2019-09-10 07:10:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:20,736 INFO L225 Difference]: With dead ends: 862730 [2019-09-10 07:10:20,736 INFO L226 Difference]: Without dead ends: 862730 [2019-09-10 07:10:20,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862730 states. [2019-09-10 07:10:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862730 to 304461. [2019-09-10 07:10:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304461 states. [2019-09-10 07:10:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304461 states to 304461 states and 424802 transitions. [2019-09-10 07:10:39,017 INFO L78 Accepts]: Start accepts. Automaton has 304461 states and 424802 transitions. Word has length 154 [2019-09-10 07:10:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:39,017 INFO L475 AbstractCegarLoop]: Abstraction has 304461 states and 424802 transitions. [2019-09-10 07:10:39,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 304461 states and 424802 transitions. [2019-09-10 07:10:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:10:39,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:39,289 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] [2019-09-10 07:10:39,289 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:39,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1301996817, now seen corresponding path program 1 times [2019-09-10 07:10:39,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:39,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:39,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:39,389 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-10 07:10:39,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:39,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:10:39,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:39,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:10:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:10:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:10:39,391 INFO L87 Difference]: Start difference. First operand 304461 states and 424802 transitions. Second operand 5 states. [2019-09-10 07:10:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:40,795 INFO L93 Difference]: Finished difference Result 419323 states and 578971 transitions. [2019-09-10 07:10:40,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:10:40,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-09-10 07:10:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:41,441 INFO L225 Difference]: With dead ends: 419323 [2019-09-10 07:10:41,441 INFO L226 Difference]: Without dead ends: 419323 [2019-09-10 07:10:41,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419323 states. [2019-09-10 07:10:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419323 to 418505. [2019-09-10 07:10:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418505 states. [2019-09-10 07:10:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418505 states to 418505 states and 578153 transitions. [2019-09-10 07:10:58,862 INFO L78 Accepts]: Start accepts. Automaton has 418505 states and 578153 transitions. Word has length 154 [2019-09-10 07:10:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:58,862 INFO L475 AbstractCegarLoop]: Abstraction has 418505 states and 578153 transitions. [2019-09-10 07:10:58,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:10:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 418505 states and 578153 transitions. [2019-09-10 07:10:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:10:59,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:59,309 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] [2019-09-10 07:10:59,309 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1650618681, now seen corresponding path program 1 times [2019-09-10 07:10:59,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:59,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:59,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:59,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:59,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:59,442 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-10 07:10:59,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:59,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:59,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:59,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:59,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:59,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:59,444 INFO L87 Difference]: Start difference. First operand 418505 states and 578153 transitions. Second operand 7 states. [2019-09-10 07:11:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:05,256 INFO L93 Difference]: Finished difference Result 1040100 states and 1421009 transitions. [2019-09-10 07:11:05,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:11:05,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 154 [2019-09-10 07:11:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:06,939 INFO L225 Difference]: With dead ends: 1040100 [2019-09-10 07:11:06,939 INFO L226 Difference]: Without dead ends: 1040100 [2019-09-10 07:11:06,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:11:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040100 states. [2019-09-10 07:11:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040100 to 422314. [2019-09-10 07:11:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422314 states. [2019-09-10 07:11:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422314 states to 422314 states and 583608 transitions. [2019-09-10 07:11:26,665 INFO L78 Accepts]: Start accepts. Automaton has 422314 states and 583608 transitions. Word has length 154 [2019-09-10 07:11:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:26,666 INFO L475 AbstractCegarLoop]: Abstraction has 422314 states and 583608 transitions. [2019-09-10 07:11:26,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 422314 states and 583608 transitions. [2019-09-10 07:11:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 07:11:27,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:27,148 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] [2019-09-10 07:11:27,148 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:27,149 INFO L82 PathProgramCache]: Analyzing trace with hash -981943530, now seen corresponding path program 1 times [2019-09-10 07:11:27,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:27,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:27,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:27,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:27,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:28,581 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-10 07:11:28,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:28,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:28,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:28,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:28,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:28,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:28,583 INFO L87 Difference]: Start difference. First operand 422314 states and 583608 transitions. Second operand 7 states. [2019-09-10 07:11:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:34,366 INFO L93 Difference]: Finished difference Result 998769 states and 1364744 transitions. [2019-09-10 07:11:34,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:11:34,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 154 [2019-09-10 07:11:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:35,949 INFO L225 Difference]: With dead ends: 998769 [2019-09-10 07:11:35,949 INFO L226 Difference]: Without dead ends: 998769 [2019-09-10 07:11:35,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:11:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998769 states. [2019-09-10 07:11:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998769 to 428122. [2019-09-10 07:11:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428122 states. [2019-09-10 07:11:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428122 states to 428122 states and 591668 transitions. [2019-09-10 07:11:55,653 INFO L78 Accepts]: Start accepts. Automaton has 428122 states and 591668 transitions. Word has length 154 [2019-09-10 07:11:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:55,653 INFO L475 AbstractCegarLoop]: Abstraction has 428122 states and 591668 transitions. [2019-09-10 07:11:55,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 428122 states and 591668 transitions. [2019-09-10 07:11:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 07:11:56,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:56,098 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] [2019-09-10 07:11:56,098 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1406707574, now seen corresponding path program 1 times [2019-09-10 07:11:56,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:56,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:56,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:03,089 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-10 07:12:03,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:03,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:12:03,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:03,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:12:03,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:12:03,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:12:03,091 INFO L87 Difference]: Start difference. First operand 428122 states and 591668 transitions. Second operand 10 states. [2019-09-10 07:12:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:26,428 INFO L93 Difference]: Finished difference Result 3073772 states and 4205319 transitions. [2019-09-10 07:12:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 07:12:26,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 07:12:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:33,079 INFO L225 Difference]: With dead ends: 3073772 [2019-09-10 07:12:33,079 INFO L226 Difference]: Without dead ends: 3073772 [2019-09-10 07:12:33,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=420, Invalid=1386, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:12:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073772 states. [2019-09-10 07:13:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073772 to 1006738. [2019-09-10 07:13:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006738 states. [2019-09-10 07:13:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006738 states to 1006738 states and 1381690 transitions. [2019-09-10 07:13:30,782 INFO L78 Accepts]: Start accepts. Automaton has 1006738 states and 1381690 transitions. Word has length 155 [2019-09-10 07:13:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:30,782 INFO L475 AbstractCegarLoop]: Abstraction has 1006738 states and 1381690 transitions. [2019-09-10 07:13:30,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1006738 states and 1381690 transitions. [2019-09-10 07:13:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 07:13:41,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:41,922 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] [2019-09-10 07:13:41,922 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:41,922 INFO L82 PathProgramCache]: Analyzing trace with hash 839448850, now seen corresponding path program 1 times [2019-09-10 07:13:41,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:41,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:41,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:41,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:41,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:42,131 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-10 07:13:42,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:42,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:42,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:42,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:42,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:42,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:42,134 INFO L87 Difference]: Start difference. First operand 1006738 states and 1381690 transitions. Second operand 5 states. [2019-09-10 07:13:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:53,148 INFO L93 Difference]: Finished difference Result 2555397 states and 3449211 transitions. [2019-09-10 07:13:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:53,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-09-10 07:13:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:12,227 INFO L225 Difference]: With dead ends: 2555397 [2019-09-10 07:14:12,228 INFO L226 Difference]: Without dead ends: 2555010 [2019-09-10 07:14:12,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:14:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555010 states.