/usr/bin/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-fb55353 [2019-11-07 04:49:55,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:49:55,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:49:55,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:49:55,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:49:55,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:49:55,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:49:55,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:49:55,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:49:55,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:49:55,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:49:55,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:49:55,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:49:55,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:49:55,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:49:55,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:49:55,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:49:55,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:49:55,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:49:55,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:49:55,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:49:55,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:49:55,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:49:55,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:49:55,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:49:55,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:49:55,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:49:55,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:49:55,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:49:55,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:49:55,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:49:55,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:49:55,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:49:55,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:49:55,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:49:55,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:49:55,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:49:55,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:49:55,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:49:55,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:49:55,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:49:55,126 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-11-07 04:49:55,139 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:49:55,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:49:55,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:49:55,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:49:55,141 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:49:55,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:49:55,142 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:49:55,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:49:55,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:49:55,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:49:55,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:49:55,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:49:55,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:49:55,143 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:49:55,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:49:55,144 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:49:55,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:49:55,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:49:55,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:49:55,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:49:55,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:49:55,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:49:55,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:49:55,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:49:55,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:49:55,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:49:55,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:49:55,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:49:55,146 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-11-07 04:49:55,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:49:55,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:49:55,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:49:55,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:49:55,473 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:49:55,474 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-11-07 04:49:55,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73962075/6e2a50180ece4782bb3dc7a1909dc62b/FLAGb48a315d7 [2019-11-07 04:49:55,999 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:49:56,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-07 04:49:56,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73962075/6e2a50180ece4782bb3dc7a1909dc62b/FLAGb48a315d7 [2019-11-07 04:49:56,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73962075/6e2a50180ece4782bb3dc7a1909dc62b [2019-11-07 04:49:56,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:49:56,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:49:56,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:49:56,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:49:56,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:49:56,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:56,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae54df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56, skipping insertion in model container [2019-11-07 04:49:56,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:56,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:49:56,543 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:49:56,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:49:56,817 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:49:56,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:49:56,993 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:49:56,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56 WrapperNode [2019-11-07 04:49:56,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:49:56,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:49:56,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:49:56,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:49:57,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:57,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:57,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:57,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:57,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:57,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:57,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (1/1) ... [2019-11-07 04:49:57,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:49:57,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:49:57,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:49:57,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:49:57,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (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-11-07 04:49:57,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:49:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:49:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-07 04:49:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2019-11-07 04:49:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:49:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:49:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:49:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:49:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 04:49:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 04:49:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2019-11-07 04:49:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-07 04:49:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:49:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:49:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:49:57,318 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:49:57,933 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-07 04:49:57,933 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-07 04:49:58,215 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:49:58,215 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 04:49:58,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:49:58 BoogieIcfgContainer [2019-11-07 04:49:58,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:49:58,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:49:58,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:49:58,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:49:58,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:49:56" (1/3) ... [2019-11-07 04:49:58,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa79b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:49:58, skipping insertion in model container [2019-11-07 04:49:58,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:56" (2/3) ... [2019-11-07 04:49:58,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa79b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:49:58, skipping insertion in model container [2019-11-07 04:49:58,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:49:58" (3/3) ... [2019-11-07 04:49:58,225 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-11-07 04:49:58,234 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:49:58,243 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:49:58,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:49:58,281 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:49:58,281 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:49:58,281 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:49:58,282 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:49:58,282 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:49:58,282 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:49:58,282 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:49:58,282 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:49:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-11-07 04:49:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:49:58,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:49:58,313 INFO L410 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-11-07 04:49:58,315 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:49:58,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:49:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash 773339422, now seen corresponding path program 1 times [2019-11-07 04:49:58,328 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:49:58,328 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329328874] [2019-11-07 04:49:58,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:49:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:49:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:49:58,596 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329328874] [2019-11-07 04:49:58,597 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:49:58,598 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:49:58,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960508457] [2019-11-07 04:49:58,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:49:58,607 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:49:58,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:49:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:49:58,624 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2019-11-07 04:49:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:49:58,798 INFO L93 Difference]: Finished difference Result 331 states and 564 transitions. [2019-11-07 04:49:58,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:49:58,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-07 04:49:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:49:58,823 INFO L225 Difference]: With dead ends: 331 [2019-11-07 04:49:58,823 INFO L226 Difference]: Without dead ends: 210 [2019-11-07 04:49:58,832 INFO L630 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-11-07 04:49:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-07 04:49:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-11-07 04:49:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-07 04:49:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 314 transitions. [2019-11-07 04:49:58,928 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 314 transitions. Word has length 47 [2019-11-07 04:49:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:49:58,929 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 314 transitions. [2019-11-07 04:49:58,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:49:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 314 transitions. [2019-11-07 04:49:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-07 04:49:58,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:49:58,935 INFO L410 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-11-07 04:49:58,935 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:49:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:49:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1521336575, now seen corresponding path program 1 times [2019-11-07 04:49:58,936 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:49:58,936 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472279023] [2019-11-07 04:49:58,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:49:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:49:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:49:59,045 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472279023] [2019-11-07 04:49:59,045 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:49:59,045 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:49:59,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210712646] [2019-11-07 04:49:59,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:49:59,054 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:49:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:49:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:49:59,054 INFO L87 Difference]: Start difference. First operand 209 states and 314 transitions. Second operand 3 states. [2019-11-07 04:49:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:49:59,259 INFO L93 Difference]: Finished difference Result 335 states and 508 transitions. [2019-11-07 04:49:59,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:49:59,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-07 04:49:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:49:59,263 INFO L225 Difference]: With dead ends: 335 [2019-11-07 04:49:59,263 INFO L226 Difference]: Without dead ends: 232 [2019-11-07 04:49:59,265 INFO L630 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-11-07 04:49:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-07 04:49:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2019-11-07 04:49:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-07 04:49:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 336 transitions. [2019-11-07 04:49:59,285 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 336 transitions. Word has length 61 [2019-11-07 04:49:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:49:59,285 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 336 transitions. [2019-11-07 04:49:59,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:49:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 336 transitions. [2019-11-07 04:49:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-07 04:49:59,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:49:59,294 INFO L410 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-11-07 04:49:59,295 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:49:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:49:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1455093476, now seen corresponding path program 1 times [2019-11-07 04:49:59,296 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:49:59,296 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470804022] [2019-11-07 04:49:59,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:49:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:49:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 04:49:59,438 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470804022] [2019-11-07 04:49:59,438 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:49:59,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:49:59,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496484414] [2019-11-07 04:49:59,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:49:59,442 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:49:59,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:49:59,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:49:59,446 INFO L87 Difference]: Start difference. First operand 228 states and 336 transitions. Second operand 4 states. [2019-11-07 04:49:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:49:59,721 INFO L93 Difference]: Finished difference Result 538 states and 824 transitions. [2019-11-07 04:49:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:49:59,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-07 04:49:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:49:59,724 INFO L225 Difference]: With dead ends: 538 [2019-11-07 04:49:59,724 INFO L226 Difference]: Without dead ends: 318 [2019-11-07 04:49:59,726 INFO L630 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-11-07 04:49:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-07 04:49:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 304. [2019-11-07 04:49:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-07 04:49:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 420 transitions. [2019-11-07 04:49:59,744 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 420 transitions. Word has length 78 [2019-11-07 04:49:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:49:59,744 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 420 transitions. [2019-11-07 04:49:59,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:49:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 420 transitions. [2019-11-07 04:49:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 04:49:59,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:49:59,748 INFO L410 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-11-07 04:49:59,748 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:49:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:49:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1671388903, now seen corresponding path program 1 times [2019-11-07 04:49:59,749 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:49:59,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850653356] [2019-11-07 04:49:59,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:49:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:49:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-07 04:49:59,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850653356] [2019-11-07 04:49:59,851 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:49:59,851 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:49:59,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571599059] [2019-11-07 04:49:59,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:49:59,852 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:49:59,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:49:59,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:49:59,853 INFO L87 Difference]: Start difference. First operand 304 states and 420 transitions. Second operand 3 states. [2019-11-07 04:50:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:00,026 INFO L93 Difference]: Finished difference Result 666 states and 948 transitions. [2019-11-07 04:50:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:00,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-07 04:50:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:00,029 INFO L225 Difference]: With dead ends: 666 [2019-11-07 04:50:00,030 INFO L226 Difference]: Without dead ends: 370 [2019-11-07 04:50:00,031 INFO L630 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-11-07 04:50:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-07 04:50:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 350. [2019-11-07 04:50:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-07 04:50:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 472 transitions. [2019-11-07 04:50:00,046 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 472 transitions. Word has length 98 [2019-11-07 04:50:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:00,047 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 472 transitions. [2019-11-07 04:50:00,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 472 transitions. [2019-11-07 04:50:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-07 04:50:00,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:00,050 INFO L410 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-11-07 04:50:00,050 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1043004154, now seen corresponding path program 1 times [2019-11-07 04:50:00,051 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:00,051 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294214574] [2019-11-07 04:50:00,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:50:00,163 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294214574] [2019-11-07 04:50:00,163 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086818917] [2019-11-07 04:50:00,163 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-11-07 04:50:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:00,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 04:50:00,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:50:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:50:00,332 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:50:00,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:50:00,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:50:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:50:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-07 04:50:00,421 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:50:00,421 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 8 [2019-11-07 04:50:00,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350245440] [2019-11-07 04:50:00,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:50:00,423 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:00,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:50:00,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:50:00,424 INFO L87 Difference]: Start difference. First operand 350 states and 472 transitions. Second operand 3 states. [2019-11-07 04:50:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:00,456 INFO L93 Difference]: Finished difference Result 533 states and 718 transitions. [2019-11-07 04:50:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:00,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-07 04:50:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:00,460 INFO L225 Difference]: With dead ends: 533 [2019-11-07 04:50:00,460 INFO L226 Difference]: Without dead ends: 530 [2019-11-07 04:50:00,462 INFO L630 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-11-07 04:50:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-07 04:50:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2019-11-07 04:50:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-11-07 04:50:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 715 transitions. [2019-11-07 04:50:00,488 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 715 transitions. Word has length 116 [2019-11-07 04:50:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:00,490 INFO L462 AbstractCegarLoop]: Abstraction has 530 states and 715 transitions. [2019-11-07 04:50:00,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 715 transitions. [2019-11-07 04:50:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 04:50:00,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:00,496 INFO L410 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-11-07 04:50:00,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:50:00,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2102726514, now seen corresponding path program 1 times [2019-11-07 04:50:00,700 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:00,701 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676872540] [2019-11-07 04:50:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 97 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:50:00,886 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676872540] [2019-11-07 04:50:00,887 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632112066] [2019-11-07 04:50:00,888 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-11-07 04:50:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:01,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 04:50:01,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:50:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-07 04:50:01,078 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:50:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-07 04:50:01,117 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 04:50:01,117 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-11-07 04:50:01,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430244268] [2019-11-07 04:50:01,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:50:01,118 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:01,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:50:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:50:01,119 INFO L87 Difference]: Start difference. First operand 530 states and 715 transitions. Second operand 3 states. [2019-11-07 04:50:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:01,278 INFO L93 Difference]: Finished difference Result 1139 states and 1584 transitions. [2019-11-07 04:50:01,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:01,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-07 04:50:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:01,292 INFO L225 Difference]: With dead ends: 1139 [2019-11-07 04:50:01,293 INFO L226 Difference]: Without dead ends: 617 [2019-11-07 04:50:01,294 INFO L630 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-11-07 04:50:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-07 04:50:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-11-07 04:50:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-11-07 04:50:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 811 transitions. [2019-11-07 04:50:01,313 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 811 transitions. Word has length 155 [2019-11-07 04:50:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:01,314 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 811 transitions. [2019-11-07 04:50:01,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 811 transitions. [2019-11-07 04:50:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-07 04:50:01,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:01,319 INFO L410 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-11-07 04:50:01,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:50:01,525 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1099269480, now seen corresponding path program 1 times [2019-11-07 04:50:01,526 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:01,526 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306540558] [2019-11-07 04:50:01,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 94 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-07 04:50:01,675 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306540558] [2019-11-07 04:50:01,676 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93717916] [2019-11-07 04:50:01,676 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-11-07 04:50:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:01,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 04:50:01,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:50:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 94 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-07 04:50:01,808 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:50:01,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:50:01,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:50:01,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:50:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-07 04:50:01,886 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:50:01,886 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 7 [2019-11-07 04:50:01,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041872554] [2019-11-07 04:50:01,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:50:01,888 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:50:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:50:01,889 INFO L87 Difference]: Start difference. First operand 617 states and 811 transitions. Second operand 3 states. [2019-11-07 04:50:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:01,934 INFO L93 Difference]: Finished difference Result 1224 states and 1612 transitions. [2019-11-07 04:50:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:01,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-07 04:50:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:01,942 INFO L225 Difference]: With dead ends: 1224 [2019-11-07 04:50:01,942 INFO L226 Difference]: Without dead ends: 1012 [2019-11-07 04:50:01,943 INFO L630 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-11-07 04:50:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-11-07 04:50:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1010. [2019-11-07 04:50:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-11-07 04:50:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1331 transitions. [2019-11-07 04:50:01,979 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1331 transitions. Word has length 182 [2019-11-07 04:50:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:01,979 INFO L462 AbstractCegarLoop]: Abstraction has 1010 states and 1331 transitions. [2019-11-07 04:50:01,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1331 transitions. [2019-11-07 04:50:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-07 04:50:01,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:01,984 INFO L410 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-11-07 04:50:02,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:50:02,189 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:02,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:02,190 INFO L82 PathProgramCache]: Analyzing trace with hash 324719230, now seen corresponding path program 1 times [2019-11-07 04:50:02,190 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:02,190 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934271758] [2019-11-07 04:50:02,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-07 04:50:02,368 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934271758] [2019-11-07 04:50:02,368 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:50:02,369 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:50:02,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661181082] [2019-11-07 04:50:02,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:50:02,370 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:50:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:50:02,370 INFO L87 Difference]: Start difference. First operand 1010 states and 1331 transitions. Second operand 3 states. [2019-11-07 04:50:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:02,601 INFO L93 Difference]: Finished difference Result 2257 states and 3089 transitions. [2019-11-07 04:50:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:02,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-07 04:50:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:02,610 INFO L225 Difference]: With dead ends: 2257 [2019-11-07 04:50:02,610 INFO L226 Difference]: Without dead ends: 1255 [2019-11-07 04:50:02,613 INFO L630 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-11-07 04:50:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-11-07 04:50:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1205. [2019-11-07 04:50:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2019-11-07 04:50:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1556 transitions. [2019-11-07 04:50:02,648 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1556 transitions. Word has length 216 [2019-11-07 04:50:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:02,649 INFO L462 AbstractCegarLoop]: Abstraction has 1205 states and 1556 transitions. [2019-11-07 04:50:02,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1556 transitions. [2019-11-07 04:50:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-07 04:50:02,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:02,654 INFO L410 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-11-07 04:50:02,654 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1583977454, now seen corresponding path program 2 times [2019-11-07 04:50:02,655 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:02,655 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881837783] [2019-11-07 04:50:02,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-11-07 04:50:02,723 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881837783] [2019-11-07 04:50:02,723 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:50:02,724 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:50:02,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086089198] [2019-11-07 04:50:02,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:50:02,725 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:50:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:50:02,725 INFO L87 Difference]: Start difference. First operand 1205 states and 1556 transitions. Second operand 3 states. [2019-11-07 04:50:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:02,939 INFO L93 Difference]: Finished difference Result 2647 states and 3539 transitions. [2019-11-07 04:50:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:02,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-07 04:50:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:02,946 INFO L225 Difference]: With dead ends: 2647 [2019-11-07 04:50:02,946 INFO L226 Difference]: Without dead ends: 1450 [2019-11-07 04:50:02,949 INFO L630 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-11-07 04:50:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-07 04:50:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1390. [2019-11-07 04:50:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2019-11-07 04:50:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1771 transitions. [2019-11-07 04:50:02,990 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1771 transitions. Word has length 216 [2019-11-07 04:50:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:02,991 INFO L462 AbstractCegarLoop]: Abstraction has 1390 states and 1771 transitions. [2019-11-07 04:50:02,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1771 transitions. [2019-11-07 04:50:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-07 04:50:02,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:02,996 INFO L410 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-11-07 04:50:02,996 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash -564171401, now seen corresponding path program 1 times [2019-11-07 04:50:02,997 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:02,997 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171313013] [2019-11-07 04:50:02,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-07 04:50:03,082 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171313013] [2019-11-07 04:50:03,082 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:50:03,083 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:50:03,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833457032] [2019-11-07 04:50:03,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:50:03,084 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:03,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:50:03,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:50:03,085 INFO L87 Difference]: Start difference. First operand 1390 states and 1771 transitions. Second operand 3 states. [2019-11-07 04:50:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:03,304 INFO L93 Difference]: Finished difference Result 2937 states and 3829 transitions. [2019-11-07 04:50:03,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:03,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-11-07 04:50:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:03,316 INFO L225 Difference]: With dead ends: 2937 [2019-11-07 04:50:03,316 INFO L226 Difference]: Without dead ends: 1555 [2019-11-07 04:50:03,319 INFO L630 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-11-07 04:50:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-07 04:50:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1515. [2019-11-07 04:50:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-11-07 04:50:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1911 transitions. [2019-11-07 04:50:03,379 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1911 transitions. Word has length 222 [2019-11-07 04:50:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:03,380 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 1911 transitions. [2019-11-07 04:50:03,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1911 transitions. [2019-11-07 04:50:03,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-07 04:50:03,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:03,389 INFO L410 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-11-07 04:50:03,389 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:03,390 INFO L82 PathProgramCache]: Analyzing trace with hash 920192313, now seen corresponding path program 1 times [2019-11-07 04:50:03,390 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:03,391 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233420284] [2019-11-07 04:50:03,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-11-07 04:50:03,521 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233420284] [2019-11-07 04:50:03,521 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:50:03,521 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:50:03,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25138117] [2019-11-07 04:50:03,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:50:03,522 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:03,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:50:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:50:03,523 INFO L87 Difference]: Start difference. First operand 1515 states and 1911 transitions. Second operand 3 states. [2019-11-07 04:50:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:03,762 INFO L93 Difference]: Finished difference Result 3288 states and 4273 transitions. [2019-11-07 04:50:03,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:03,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-07 04:50:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:03,773 INFO L225 Difference]: With dead ends: 3288 [2019-11-07 04:50:03,774 INFO L226 Difference]: Without dead ends: 1776 [2019-11-07 04:50:03,777 INFO L630 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-11-07 04:50:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2019-11-07 04:50:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1750. [2019-11-07 04:50:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-11-07 04:50:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2281 transitions. [2019-11-07 04:50:03,831 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2281 transitions. Word has length 226 [2019-11-07 04:50:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:03,831 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 2281 transitions. [2019-11-07 04:50:03,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2281 transitions. [2019-11-07 04:50:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-07 04:50:03,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:03,838 INFO L410 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-11-07 04:50:03,838 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1135977196, now seen corresponding path program 1 times [2019-11-07 04:50:03,839 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:03,839 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804646933] [2019-11-07 04:50:03,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-07 04:50:03,924 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804646933] [2019-11-07 04:50:03,924 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:50:03,924 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:50:03,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768950021] [2019-11-07 04:50:03,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:50:03,926 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:03,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:50:03,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:50:03,926 INFO L87 Difference]: Start difference. First operand 1750 states and 2281 transitions. Second operand 3 states. [2019-11-07 04:50:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:04,169 INFO L93 Difference]: Finished difference Result 3637 states and 4799 transitions. [2019-11-07 04:50:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:50:04,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-07 04:50:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:04,178 INFO L225 Difference]: With dead ends: 3637 [2019-11-07 04:50:04,179 INFO L226 Difference]: Without dead ends: 1895 [2019-11-07 04:50:04,182 INFO L630 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-11-07 04:50:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2019-11-07 04:50:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1885. [2019-11-07 04:50:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2019-11-07 04:50:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2431 transitions. [2019-11-07 04:50:04,248 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2431 transitions. Word has length 244 [2019-11-07 04:50:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:04,249 INFO L462 AbstractCegarLoop]: Abstraction has 1885 states and 2431 transitions. [2019-11-07 04:50:04,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:50:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2431 transitions. [2019-11-07 04:50:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-11-07 04:50:04,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:04,261 INFO L410 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-11-07 04:50:04,261 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1613466002, now seen corresponding path program 1 times [2019-11-07 04:50:04,262 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:04,263 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34296615] [2019-11-07 04:50:04,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 576 proven. 25 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-07 04:50:04,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34296615] [2019-11-07 04:50:04,442 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131721112] [2019-11-07 04:50:04,442 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-11-07 04:50:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:04,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 04:50:04,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:50:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-11-07 04:50:04,732 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:50:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-11-07 04:50:04,804 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 04:50:04,804 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [4] total 7 [2019-11-07 04:50:04,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318952049] [2019-11-07 04:50:04,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:50:04,805 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:50:04,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:50:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:50:04,806 INFO L87 Difference]: Start difference. First operand 1885 states and 2431 transitions. Second operand 5 states. [2019-11-07 04:50:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:50:05,183 INFO L93 Difference]: Finished difference Result 3916 states and 5030 transitions. [2019-11-07 04:50:05,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:50:05,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 276 [2019-11-07 04:50:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:50:05,192 INFO L225 Difference]: With dead ends: 3916 [2019-11-07 04:50:05,192 INFO L226 Difference]: Without dead ends: 1834 [2019-11-07 04:50:05,199 INFO L630 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-11-07 04:50:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-11-07 04:50:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1763. [2019-11-07 04:50:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-11-07 04:50:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2288 transitions. [2019-11-07 04:50:05,251 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2288 transitions. Word has length 276 [2019-11-07 04:50:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:50:05,251 INFO L462 AbstractCegarLoop]: Abstraction has 1763 states and 2288 transitions. [2019-11-07 04:50:05,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:50:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2288 transitions. [2019-11-07 04:50:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-11-07 04:50:05,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:50:05,259 INFO L410 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-11-07 04:50:05,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:50:05,463 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:50:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:50:05,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1911745540, now seen corresponding path program 1 times [2019-11-07 04:50:05,464 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:50:05,464 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060077270] [2019-11-07 04:50:05,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:50:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 715 proven. 25 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-11-07 04:50:05,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060077270] [2019-11-07 04:50:05,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174932978] [2019-11-07 04:50:05,745 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-11-07 04:50:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:50:05,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 04:50:05,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:50:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 715 proven. 25 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-11-07 04:50:05,997 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:50:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 715 proven. 25 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-11-07 04:50:06,180 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [889103237] [2019-11-07 04:50:06,240 INFO L159 IcfgInterpreter]: Started Sifa with 77 locations of interest [2019-11-07 04:50:06,240 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:50:06,248 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:50:06,254 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:50:06,257 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:50:06,317 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:50:06,321 INFO L197 IcfgInterpreter]: Interpreting procedure ssl3_accept with input of size 3 for LOIs [2019-11-07 04:50:08,048 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-11-07 04:50:11,858 INFO L197 IcfgInterpreter]: Interpreting procedure ERR with input of size 1 for LOIs [2019-11-07 04:50:11,862 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:50:11,864 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:50:12,426 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 125 [2019-11-07 04:50:13,007 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 123 [2019-11-07 04:50:13,524 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 126 [2019-11-07 04:50:14,090 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 129 [2019-11-07 04:50:14,652 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 132 [2019-11-07 04:50:15,247 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 135 [2019-11-07 04:50:16,193 WARN L191 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 138 [2019-11-07 04:50:17,177 WARN L191 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 141 [2019-11-07 04:50:18,129 WARN L191 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 144 [2019-11-07 04:50:19,085 WARN L191 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 147 [2019-11-07 04:50:20,084 WARN L191 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 150 [2019-11-07 04:50:21,015 WARN L191 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 128 [2019-11-07 04:50:21,933 WARN L191 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 134 [2019-11-07 04:50:22,562 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2019-11-07 04:50:23,740 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 168 DAG size of output: 154 [2019-11-07 04:50:24,883 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-11-07 04:50:26,070 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 174 DAG size of output: 160 [2019-11-07 04:50:26,863 WARN L191 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 131 [2019-11-07 04:50:27,635 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 135 [2019-11-07 04:50:28,867 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 177 DAG size of output: 163 [2019-11-07 04:50:30,143 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 180 DAG size of output: 166 [2019-11-07 04:50:30,946 WARN L191 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 131 [2019-11-07 04:50:31,778 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 133 [2019-11-07 04:50:32,542 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 138 [2019-11-07 04:50:33,834 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 183 DAG size of output: 169 [2019-11-07 04:50:35,205 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 186 DAG size of output: 172 [2019-11-07 04:50:36,097 WARN L191 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 131