java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:30:58,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:30:58,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:30:58,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:30:58,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:30:58,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:30:58,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:30:58,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:30:58,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:30:58,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:30:58,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:30:58,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:30:58,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:30:58,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:30:58,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:30:58,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:30:58,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:30:58,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:30:58,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:30:58,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:30:58,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:30:58,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:30:58,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:30:58,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:30:58,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:30:58,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:30:58,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:30:58,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:30:58,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:30:58,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:30:58,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:30:58,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:30:58,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:30:58,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:30:58,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:30:58,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:30:58,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:30:58,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:30:58,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:30:58,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:30:58,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:30:58,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:30:58,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:30:58,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:30:58,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:30:58,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:30:58,547 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:30:58,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:30:58,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:30:58,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:30:58,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:30:58,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:30:58,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:30:58,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:30:58,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:30:58,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:30:58,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:30:58,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:30:58,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:30:58,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:30:58,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:30:58,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:30:58,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:30:58,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:30:58,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:30:58,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:30:58,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:30:58,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:30:58,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:30:58,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:30:58,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:30:58,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:30:58,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:30:58,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:30:58,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:30:58,839 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:30:58,840 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-15 03:30:58,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d647670ba/ec6d3b6b095f4c6e83afe2bbf1a1d5da/FLAG124e232a5 [2019-10-15 03:30:59,423 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:30:59,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-15 03:30:59,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d647670ba/ec6d3b6b095f4c6e83afe2bbf1a1d5da/FLAG124e232a5 [2019-10-15 03:30:59,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d647670ba/ec6d3b6b095f4c6e83afe2bbf1a1d5da [2019-10-15 03:30:59,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:30:59,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:30:59,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:59,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:30:59,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:30:59,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:59" (1/1) ... [2019-10-15 03:30:59,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af48675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:59, skipping insertion in model container [2019-10-15 03:30:59,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:59" (1/1) ... [2019-10-15 03:30:59,771 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:30:59,821 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:31:00,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:00,117 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:31:00,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:00,295 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:31:00,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00 WrapperNode [2019-10-15 03:31:00,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:00,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:31:00,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:31:00,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:31:00,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (1/1) ... [2019-10-15 03:31:00,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (1/1) ... [2019-10-15 03:31:00,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (1/1) ... [2019-10-15 03:31:00,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (1/1) ... [2019-10-15 03:31:00,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (1/1) ... [2019-10-15 03:31:00,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (1/1) ... [2019-10-15 03:31:00,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (1/1) ... [2019-10-15 03:31:00,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:31:00,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:31:00,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:31:00,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:31:00,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (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-10-15 03:31:00,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:31:00,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:31:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 03:31:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2019-10-15 03:31:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:31:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:31:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:31:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:31:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:31:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:31:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2019-10-15 03:31:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 03:31:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:31:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:31:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:31:00,702 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:31:01,223 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 03:31:01,223 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 03:31:01,511 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:31:01,511 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:31:01,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:01 BoogieIcfgContainer [2019-10-15 03:31:01,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:31:01,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:31:01,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:31:01,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:31:01,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:30:59" (1/3) ... [2019-10-15 03:31:01,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ffed6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:01, skipping insertion in model container [2019-10-15 03:31:01,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:00" (2/3) ... [2019-10-15 03:31:01,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ffed6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:01, skipping insertion in model container [2019-10-15 03:31:01,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:01" (3/3) ... [2019-10-15 03:31:01,522 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-10-15 03:31:01,532 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:31:01,540 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:31:01,552 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:31:01,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:31:01,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:31:01,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:31:01,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:31:01,600 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:31:01,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:31:01,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:31:01,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:31:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-10-15 03:31:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:31:01,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:01,634 INFO L380 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] [2019-10-15 03:31:01,636 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:01,641 INFO L82 PathProgramCache]: Analyzing trace with hash 773339422, now seen corresponding path program 1 times [2019-10-15 03:31:01,650 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:01,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710846498] [2019-10-15 03:31:01,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:01,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:01,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710846498] [2019-10-15 03:31:01,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:01,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:01,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593345454] [2019-10-15 03:31:01,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:01,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:01,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:01,925 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2019-10-15 03:31:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:02,057 INFO L93 Difference]: Finished difference Result 331 states and 564 transitions. [2019-10-15 03:31:02,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:02,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 03:31:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:02,073 INFO L225 Difference]: With dead ends: 331 [2019-10-15 03:31:02,074 INFO L226 Difference]: Without dead ends: 210 [2019-10-15 03:31:02,079 INFO L600 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-10-15 03:31:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-15 03:31:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-10-15 03:31:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-15 03:31:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 314 transitions. [2019-10-15 03:31:02,187 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 314 transitions. Word has length 47 [2019-10-15 03:31:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:02,188 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 314 transitions. [2019-10-15 03:31:02,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 314 transitions. [2019-10-15 03:31:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 03:31:02,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:02,196 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:02,196 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1521336575, now seen corresponding path program 1 times [2019-10-15 03:31:02,197 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:02,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770861582] [2019-10-15 03:31:02,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:02,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:02,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:02,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770861582] [2019-10-15 03:31:02,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:02,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:02,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878724931] [2019-10-15 03:31:02,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:02,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:02,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:02,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:02,331 INFO L87 Difference]: Start difference. First operand 209 states and 314 transitions. Second operand 3 states. [2019-10-15 03:31:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:02,525 INFO L93 Difference]: Finished difference Result 335 states and 508 transitions. [2019-10-15 03:31:02,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:02,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-15 03:31:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:02,529 INFO L225 Difference]: With dead ends: 335 [2019-10-15 03:31:02,529 INFO L226 Difference]: Without dead ends: 232 [2019-10-15 03:31:02,531 INFO L600 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-10-15 03:31:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-15 03:31:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2019-10-15 03:31:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-15 03:31:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 336 transitions. [2019-10-15 03:31:02,554 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 336 transitions. Word has length 61 [2019-10-15 03:31:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:02,554 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 336 transitions. [2019-10-15 03:31:02,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 336 transitions. [2019-10-15 03:31:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 03:31:02,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:02,568 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:02,568 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:02,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1455093476, now seen corresponding path program 1 times [2019-10-15 03:31:02,569 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:02,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974701663] [2019-10-15 03:31:02,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:02,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:02,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 03:31:02,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974701663] [2019-10-15 03:31:02,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:02,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:02,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228400849] [2019-10-15 03:31:02,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:02,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:02,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:02,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:02,720 INFO L87 Difference]: Start difference. First operand 228 states and 336 transitions. Second operand 4 states. [2019-10-15 03:31:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:02,960 INFO L93 Difference]: Finished difference Result 538 states and 824 transitions. [2019-10-15 03:31:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:02,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-15 03:31:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:02,963 INFO L225 Difference]: With dead ends: 538 [2019-10-15 03:31:02,963 INFO L226 Difference]: Without dead ends: 318 [2019-10-15 03:31:02,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-15 03:31:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 304. [2019-10-15 03:31:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 03:31:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 420 transitions. [2019-10-15 03:31:02,984 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 420 transitions. Word has length 78 [2019-10-15 03:31:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:02,985 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 420 transitions. [2019-10-15 03:31:02,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 420 transitions. [2019-10-15 03:31:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 03:31:02,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:02,993 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:02,993 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1671388903, now seen corresponding path program 1 times [2019-10-15 03:31:02,996 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:02,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486898946] [2019-10-15 03:31:02,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:02,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:02,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 03:31:03,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486898946] [2019-10-15 03:31:03,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:03,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:03,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857558164] [2019-10-15 03:31:03,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:03,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:03,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:03,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:03,132 INFO L87 Difference]: Start difference. First operand 304 states and 420 transitions. Second operand 3 states. [2019-10-15 03:31:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:03,294 INFO L93 Difference]: Finished difference Result 666 states and 948 transitions. [2019-10-15 03:31:03,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:03,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-15 03:31:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:03,297 INFO L225 Difference]: With dead ends: 666 [2019-10-15 03:31:03,298 INFO L226 Difference]: Without dead ends: 370 [2019-10-15 03:31:03,299 INFO L600 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-10-15 03:31:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-15 03:31:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 350. [2019-10-15 03:31:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-15 03:31:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 472 transitions. [2019-10-15 03:31:03,314 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 472 transitions. Word has length 98 [2019-10-15 03:31:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:03,314 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 472 transitions. [2019-10-15 03:31:03,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 472 transitions. [2019-10-15 03:31:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 03:31:03,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:03,317 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-10-15 03:31:03,317 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1043004154, now seen corresponding path program 1 times [2019-10-15 03:31:03,318 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:03,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381063514] [2019-10-15 03:31:03,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:03,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:03,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:03,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381063514] [2019-10-15 03:31:03,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236162905] [2019-10-15 03:31:03,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:03,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:31:03,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:03,588 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:03,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:03,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:03,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-15 03:31:03,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:03,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 8 [2019-10-15 03:31:03,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292355225] [2019-10-15 03:31:03,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:03,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:03,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:03,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:31:03,690 INFO L87 Difference]: Start difference. First operand 350 states and 472 transitions. Second operand 3 states. [2019-10-15 03:31:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:03,719 INFO L93 Difference]: Finished difference Result 533 states and 718 transitions. [2019-10-15 03:31:03,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:03,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-15 03:31:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:03,724 INFO L225 Difference]: With dead ends: 533 [2019-10-15 03:31:03,724 INFO L226 Difference]: Without dead ends: 530 [2019-10-15 03:31:03,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:31:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-10-15 03:31:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2019-10-15 03:31:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-10-15 03:31:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 715 transitions. [2019-10-15 03:31:03,748 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 715 transitions. Word has length 116 [2019-10-15 03:31:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:03,749 INFO L462 AbstractCegarLoop]: Abstraction has 530 states and 715 transitions. [2019-10-15 03:31:03,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 715 transitions. [2019-10-15 03:31:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 03:31:03,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:03,753 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 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-10-15 03:31:03,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:03,958 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2102726514, now seen corresponding path program 1 times [2019-10-15 03:31:03,959 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:03,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364309149] [2019-10-15 03:31:03,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:03,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:03,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 97 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:04,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364309149] [2019-10-15 03:31:04,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749617697] [2019-10-15 03:31:04,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:04,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:31:04,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-15 03:31:04,260 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-15 03:31:04,300 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:04,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 03:31:04,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602261002] [2019-10-15 03:31:04,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:04,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:04,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:04,303 INFO L87 Difference]: Start difference. First operand 530 states and 715 transitions. Second operand 3 states. [2019-10-15 03:31:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:04,460 INFO L93 Difference]: Finished difference Result 1139 states and 1584 transitions. [2019-10-15 03:31:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:04,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-15 03:31:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:04,466 INFO L225 Difference]: With dead ends: 1139 [2019-10-15 03:31:04,466 INFO L226 Difference]: Without dead ends: 617 [2019-10-15 03:31:04,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-15 03:31:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-15 03:31:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-15 03:31:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 811 transitions. [2019-10-15 03:31:04,487 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 811 transitions. Word has length 155 [2019-10-15 03:31:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:04,488 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 811 transitions. [2019-10-15 03:31:04,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 811 transitions. [2019-10-15 03:31:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-15 03:31:04,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:04,494 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 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-10-15 03:31:04,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:04,704 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1099269480, now seen corresponding path program 1 times [2019-10-15 03:31:04,704 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:04,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280145554] [2019-10-15 03:31:04,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:04,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:04,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 94 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 03:31:04,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280145554] [2019-10-15 03:31:04,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097636109] [2019-10-15 03:31:04,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:04,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:31:04,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 94 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 03:31:04,962 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:04,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:04,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:04,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-15 03:31:05,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:05,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 7 [2019-10-15 03:31:05,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051770345] [2019-10-15 03:31:05,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:05,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:05,027 INFO L87 Difference]: Start difference. First operand 617 states and 811 transitions. Second operand 3 states. [2019-10-15 03:31:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:05,068 INFO L93 Difference]: Finished difference Result 1224 states and 1612 transitions. [2019-10-15 03:31:05,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:05,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-15 03:31:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:05,073 INFO L225 Difference]: With dead ends: 1224 [2019-10-15 03:31:05,073 INFO L226 Difference]: Without dead ends: 1012 [2019-10-15 03:31:05,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 360 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-10-15 03:31:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1010. [2019-10-15 03:31:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-10-15 03:31:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1331 transitions. [2019-10-15 03:31:05,107 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1331 transitions. Word has length 182 [2019-10-15 03:31:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:05,107 INFO L462 AbstractCegarLoop]: Abstraction has 1010 states and 1331 transitions. [2019-10-15 03:31:05,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1331 transitions. [2019-10-15 03:31:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-15 03:31:05,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:05,112 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:05,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:05,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:05,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash 324719230, now seen corresponding path program 1 times [2019-10-15 03:31:05,318 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:05,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194229287] [2019-10-15 03:31:05,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:05,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:05,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-15 03:31:05,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194229287] [2019-10-15 03:31:05,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:05,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:05,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405760528] [2019-10-15 03:31:05,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:05,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:05,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:05,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:05,414 INFO L87 Difference]: Start difference. First operand 1010 states and 1331 transitions. Second operand 3 states. [2019-10-15 03:31:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:05,673 INFO L93 Difference]: Finished difference Result 2257 states and 3089 transitions. [2019-10-15 03:31:05,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:05,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-10-15 03:31:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:05,683 INFO L225 Difference]: With dead ends: 2257 [2019-10-15 03:31:05,683 INFO L226 Difference]: Without dead ends: 1255 [2019-10-15 03:31:05,686 INFO L600 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-10-15 03:31:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-10-15 03:31:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1205. [2019-10-15 03:31:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2019-10-15 03:31:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1556 transitions. [2019-10-15 03:31:05,738 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1556 transitions. Word has length 216 [2019-10-15 03:31:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:05,738 INFO L462 AbstractCegarLoop]: Abstraction has 1205 states and 1556 transitions. [2019-10-15 03:31:05,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1556 transitions. [2019-10-15 03:31:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-15 03:31:05,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:05,747 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:05,748 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1583977454, now seen corresponding path program 2 times [2019-10-15 03:31:05,749 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:05,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118372497] [2019-10-15 03:31:05,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:05,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:05,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-10-15 03:31:05,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118372497] [2019-10-15 03:31:05,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:05,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:05,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960209114] [2019-10-15 03:31:05,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:05,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:05,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:05,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:05,863 INFO L87 Difference]: Start difference. First operand 1205 states and 1556 transitions. Second operand 3 states. [2019-10-15 03:31:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:06,056 INFO L93 Difference]: Finished difference Result 2647 states and 3539 transitions. [2019-10-15 03:31:06,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:06,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-10-15 03:31:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:06,063 INFO L225 Difference]: With dead ends: 2647 [2019-10-15 03:31:06,064 INFO L226 Difference]: Without dead ends: 1450 [2019-10-15 03:31:06,070 INFO L600 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-10-15 03:31:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-15 03:31:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1390. [2019-10-15 03:31:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2019-10-15 03:31:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1771 transitions. [2019-10-15 03:31:06,116 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1771 transitions. Word has length 216 [2019-10-15 03:31:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:06,117 INFO L462 AbstractCegarLoop]: Abstraction has 1390 states and 1771 transitions. [2019-10-15 03:31:06,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1771 transitions. [2019-10-15 03:31:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-15 03:31:06,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:06,122 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:06,123 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:06,123 INFO L82 PathProgramCache]: Analyzing trace with hash -564171401, now seen corresponding path program 1 times [2019-10-15 03:31:06,123 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:06,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904194842] [2019-10-15 03:31:06,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:06,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:06,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-15 03:31:06,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904194842] [2019-10-15 03:31:06,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:06,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:06,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487935524] [2019-10-15 03:31:06,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:06,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:06,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:06,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:06,305 INFO L87 Difference]: Start difference. First operand 1390 states and 1771 transitions. Second operand 3 states. [2019-10-15 03:31:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:06,528 INFO L93 Difference]: Finished difference Result 2937 states and 3829 transitions. [2019-10-15 03:31:06,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:06,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-15 03:31:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:06,537 INFO L225 Difference]: With dead ends: 2937 [2019-10-15 03:31:06,538 INFO L226 Difference]: Without dead ends: 1555 [2019-10-15 03:31:06,542 INFO L600 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-10-15 03:31:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-10-15 03:31:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1515. [2019-10-15 03:31:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-10-15 03:31:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1911 transitions. [2019-10-15 03:31:06,603 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1911 transitions. Word has length 222 [2019-10-15 03:31:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:06,604 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 1911 transitions. [2019-10-15 03:31:06,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1911 transitions. [2019-10-15 03:31:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-15 03:31:06,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:06,615 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:06,615 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:06,616 INFO L82 PathProgramCache]: Analyzing trace with hash 920192313, now seen corresponding path program 1 times [2019-10-15 03:31:06,616 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:06,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741658807] [2019-10-15 03:31:06,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:06,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:06,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-10-15 03:31:06,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741658807] [2019-10-15 03:31:06,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:06,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:06,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182168515] [2019-10-15 03:31:06,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:06,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:06,694 INFO L87 Difference]: Start difference. First operand 1515 states and 1911 transitions. Second operand 3 states. [2019-10-15 03:31:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:06,910 INFO L93 Difference]: Finished difference Result 3288 states and 4273 transitions. [2019-10-15 03:31:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:06,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-15 03:31:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:06,920 INFO L225 Difference]: With dead ends: 3288 [2019-10-15 03:31:06,920 INFO L226 Difference]: Without dead ends: 1776 [2019-10-15 03:31:06,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2019-10-15 03:31:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1750. [2019-10-15 03:31:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-10-15 03:31:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2281 transitions. [2019-10-15 03:31:06,980 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2281 transitions. Word has length 226 [2019-10-15 03:31:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:06,981 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 2281 transitions. [2019-10-15 03:31:06,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2281 transitions. [2019-10-15 03:31:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-15 03:31:06,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:06,987 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:06,987 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:06,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1135977196, now seen corresponding path program 1 times [2019-10-15 03:31:06,988 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:06,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139501759] [2019-10-15 03:31:06,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:06,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:06,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-10-15 03:31:07,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139501759] [2019-10-15 03:31:07,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:07,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:07,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873320300] [2019-10-15 03:31:07,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:07,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:07,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:07,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:07,073 INFO L87 Difference]: Start difference. First operand 1750 states and 2281 transitions. Second operand 3 states. [2019-10-15 03:31:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:07,254 INFO L93 Difference]: Finished difference Result 3637 states and 4799 transitions. [2019-10-15 03:31:07,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:07,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-15 03:31:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:07,267 INFO L225 Difference]: With dead ends: 3637 [2019-10-15 03:31:07,267 INFO L226 Difference]: Without dead ends: 1895 [2019-10-15 03:31:07,272 INFO L600 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-10-15 03:31:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2019-10-15 03:31:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1885. [2019-10-15 03:31:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2019-10-15 03:31:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2431 transitions. [2019-10-15 03:31:07,368 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2431 transitions. Word has length 244 [2019-10-15 03:31:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:07,369 INFO L462 AbstractCegarLoop]: Abstraction has 1885 states and 2431 transitions. [2019-10-15 03:31:07,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2431 transitions. [2019-10-15 03:31:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-15 03:31:07,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:07,382 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:07,382 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:07,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1613466002, now seen corresponding path program 1 times [2019-10-15 03:31:07,383 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:07,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23478836] [2019-10-15 03:31:07,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:07,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:07,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 576 proven. 25 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-15 03:31:07,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23478836] [2019-10-15 03:31:07,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881382203] [2019-10-15 03:31:07,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:07,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:31:07,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-10-15 03:31:07,755 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-10-15 03:31:07,839 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:07,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [4] total 7 [2019-10-15 03:31:07,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776543647] [2019-10-15 03:31:07,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:07,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:07,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:07,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:07,844 INFO L87 Difference]: Start difference. First operand 1885 states and 2431 transitions. Second operand 5 states. [2019-10-15 03:31:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:08,205 INFO L93 Difference]: Finished difference Result 3916 states and 5030 transitions. [2019-10-15 03:31:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:08,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 276 [2019-10-15 03:31:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:08,215 INFO L225 Difference]: With dead ends: 3916 [2019-10-15 03:31:08,215 INFO L226 Difference]: Without dead ends: 1834 [2019-10-15 03:31:08,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-10-15 03:31:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1763. [2019-10-15 03:31:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-10-15 03:31:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2288 transitions. [2019-10-15 03:31:08,274 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2288 transitions. Word has length 276 [2019-10-15 03:31:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:08,274 INFO L462 AbstractCegarLoop]: Abstraction has 1763 states and 2288 transitions. [2019-10-15 03:31:08,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2288 transitions. [2019-10-15 03:31:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-15 03:31:08,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:08,282 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:08,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:08,488 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1911745540, now seen corresponding path program 1 times [2019-10-15 03:31:08,489 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:08,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082340733] [2019-10-15 03:31:08,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:08,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:08,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 715 proven. 25 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 03:31:08,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082340733] [2019-10-15 03:31:08,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468147944] [2019-10-15 03:31:08,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:08,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:31:08,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 715 proven. 25 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 03:31:08,946 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 715 proven. 25 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 03:31:09,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [371192056] [2019-10-15 03:31:09,078 INFO L162 IcfgInterpreter]: Started Sifa with 77 locations of interest [2019-10-15 03:31:09,078 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:31:09,085 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:31:09,095 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:31:09,096 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:31:09,162 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:31:09,172 INFO L199 IcfgInterpreter]: Interpreting procedure ssl3_accept with input of size 3 for LOIs [2019-10-15 03:31:11,730 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 176